./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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.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 230b725329634d718374ec3f6d82161758e5d9913588383fdc3e35a9fd1533f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 19:20:17,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 19:20:17,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 19:20:17,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 19:20:17,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 19:20:17,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 19:20:17,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 19:20:17,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 19:20:17,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 19:20:17,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 19:20:17,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 19:20:17,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 19:20:17,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 19:20:17,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 19:20:17,934 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 19:20:17,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 19:20:17,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 19:20:17,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 19:20:17,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 19:20:17,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 19:20:17,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 19:20:17,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 19:20:17,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 19:20:17,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 19:20:17,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 19:20:17,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 19:20:17,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:20:17,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:20:17,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:20:17,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:20:17,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 19:20:17,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:20:17,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:20:17,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:20:17,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:20:17,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 19:20:17,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 19:20:17,938 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 19:20:17,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 19:20:17,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 19:20:17,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 19:20:17,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 19:20:17,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 19:20:17,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 19:20:17,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 19:20:17,939 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 -> 230b725329634d718374ec3f6d82161758e5d9913588383fdc3e35a9fd1533f5 [2025-01-09 19:20:18,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 19:20:18,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 19:20:18,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 19:20:18,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 19:20:18,282 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 19:20:18,283 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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2025-01-09 19:20:19,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b6c6a534/869c51f87fe5430dabe99c4f09136b65/FLAG7814291af [2025-01-09 19:20:20,294 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 19:20:20,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2025-01-09 19:20:20,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b6c6a534/869c51f87fe5430dabe99c4f09136b65/FLAG7814291af [2025-01-09 19:20:20,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b6c6a534/869c51f87fe5430dabe99c4f09136b65 [2025-01-09 19:20:20,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 19:20:20,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 19:20:20,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 19:20:20,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 19:20:20,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 19:20:20,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:20:20" (1/1) ... [2025-01-09 19:20:20,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139d9e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:20, skipping insertion in model container [2025-01-09 19:20:20,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:20:20" (1/1) ... [2025-01-09 19:20:20,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 19:20:21,652 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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] [2025-01-09 19:20:21,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:20:21,742 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 19:20:21,882 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; subl %2, %0; sete %1": "+m" (v->counter), "=qm" (c): "er" (i): "memory"); [4273-4274] [2025-01-09 19:20:21,886 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; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [4285-4286] [2025-01-09 19:20:21,887 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; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [4289-4290] [2025-01-09 19:20:21,887 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; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [4293-4294] [2025-01-09 19:20:21,887 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; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [4297-4298] [2025-01-09 19:20:21,998 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-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i[164687,164700] [2025-01-09 19:20:22,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:20:22,045 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: __xadd_wrong_size [2025-01-09 19:20:22,052 INFO L204 MainTranslator]: Completed translation [2025-01-09 19:20:22,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22 WrapperNode [2025-01-09 19:20:22,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 19:20:22,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 19:20:22,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 19:20:22,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 19:20:22,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,203 INFO L138 Inliner]: procedures = 147, calls = 882, calls flagged for inlining = 62, calls inlined = 60, statements flattened = 2112 [2025-01-09 19:20:22,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 19:20:22,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 19:20:22,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 19:20:22,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 19:20:22,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,540 INFO L175 MemorySlicer]: Split 543 memory accesses to 16 slices as follows [218, 2, 2, 8, 2, 182, 2, 14, 5, 3, 16, 14, 4, 3, 56, 12]. 40 percent of accesses are in the largest equivalence class. The 258 initializations are split as follows [17, 2, 0, 0, 0, 182, 0, 14, 5, 3, 16, 14, 3, 2, 0, 0]. The 146 writes are split as follows [81, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 51, 12]. [2025-01-09 19:20:22,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 19:20:22,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 19:20:22,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 19:20:22,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 19:20:22,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (1/1) ... [2025-01-09 19:20:22,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:20:22,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:22,810 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 19:20:22,813 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 19:20:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 19:20:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 19:20:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 19:20:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 19:20:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 19:20:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 19:20:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 19:20:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 19:20:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 19:20:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 19:20:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 19:20:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 19:20:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 19:20:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 19:20:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 19:20:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 19:20:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-01-09 19:20:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-01-09 19:20:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 19:20:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 19:20:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 19:20:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 19:20:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 19:20:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 19:20:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 19:20:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 19:20:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 19:20:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-01-09 19:20:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 19:20:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 19:20:22,849 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 19:20:22,849 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 19:20:22,850 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-01-09 19:20:22,850 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-01-09 19:20:22,850 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-01-09 19:20:22,850 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-01-09 19:20:22,850 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-01-09 19:20:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 19:20:22,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 19:20:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_data [2025-01-09 19:20:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_data [2025-01-09 19:20:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure blk_put_request [2025-01-09 19:20:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_put_request [2025-01-09 19:20:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2025-01-09 19:20:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2025-01-09 19:20:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 19:20:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 19:20:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 19:20:22,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure send_mode_select [2025-01-09 19:20:22,852 INFO L138 BoogieDeclarations]: Found implementation of procedure send_mode_select [2025-01-09 19:20:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-01-09 19:20:22,852 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 19:20:22,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 19:20:22,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unregister_device_handler [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unregister_device_handler [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure submit_inquiry [2025-01-09 19:20:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_inquiry [2025-01-09 19:20:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_bus_detach [2025-01-09 19:20:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_bus_detach [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure rdac_match [2025-01-09 19:20:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rdac_match [2025-01-09 19:20:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 19:20:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure blk_execute_rq [2025-01-09 19:20:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_execute_rq [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 19:20:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure sdev_prefix_printk [2025-01-09 19:20:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure sdev_prefix_printk [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2025-01-09 19:20:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 19:20:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 19:20:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure check_ownership [2025-01-09 19:20:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure check_ownership [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2025-01-09 19:20:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure get_rdac_req [2025-01-09 19:20:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure get_rdac_req [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 19:20:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 19:20:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-01-09 19:20:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-01-09 19:20:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2025-01-09 19:20:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 19:20:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 19:20:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 19:20:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2025-01-09 19:20:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2025-01-09 19:20:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 19:20:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 19:20:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 19:20:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 19:20:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 19:20:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 19:20:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 19:20:22,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 19:20:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 19:20:22,863 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 19:20:23,383 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 19:20:23,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 19:20:23,901 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 19:20:30,217 INFO L? ?]: Removed 1138 outVars from TransFormulas that were not future-live. [2025-01-09 19:20:30,218 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 19:20:30,239 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 19:20:30,239 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 19:20:30,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:20:30 BoogieIcfgContainer [2025-01-09 19:20:30,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 19:20:30,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 19:20:30,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 19:20:30,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 19:20:30,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:20:20" (1/3) ... [2025-01-09 19:20:30,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfd4cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:20:30, skipping insertion in model container [2025-01-09 19:20:30,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:20:22" (2/3) ... [2025-01-09 19:20:30,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfd4cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:20:30, skipping insertion in model container [2025-01-09 19:20:30,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:20:30" (3/3) ... [2025-01-09 19:20:30,252 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i [2025-01-09 19:20:30,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 19:20:30,266 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--scsi--device_handler--scsi_dh_rdac.ko-entry_point.cil.out.i that has 72 procedures, 767 locations, 1 initial locations, 49 loop locations, and 2 error locations. [2025-01-09 19:20:30,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 19:20:30,348 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;@7f69353e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 19:20:30,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 19:20:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 635 states, 466 states have (on average 1.388412017167382) internal successors, (647), 487 states have internal predecessors, (647), 125 states have call successors, (125), 42 states have call predecessors, (125), 41 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-01-09 19:20:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 19:20:30,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:30,365 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:30,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:30,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1710315231, now seen corresponding path program 1 times [2025-01-09 19:20:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:30,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361396587] [2025-01-09 19:20:30,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:31,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 19:20:31,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 19:20:31,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:31,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 19:20:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361396587] [2025-01-09 19:20:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361396587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:20:31,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125126673] [2025-01-09 19:20:31,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:31,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:31,899 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 19:20:31,900 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 19:20:32,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 19:20:33,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 19:20:33,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:33,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:33,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 1833 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 19:20:33,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:20:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 19:20:33,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:20:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125126673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:20:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 19:20:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313207320] [2025-01-09 19:20:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 19:20:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 19:20:33,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 19:20:33,350 INFO L87 Difference]: Start difference. First operand has 635 states, 466 states have (on average 1.388412017167382) internal successors, (647), 487 states have internal predecessors, (647), 125 states have call successors, (125), 42 states have call predecessors, (125), 41 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 19:20:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:33,453 INFO L93 Difference]: Finished difference Result 1264 states and 1822 transitions. [2025-01-09 19:20:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 19:20:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-01-09 19:20:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:33,477 INFO L225 Difference]: With dead ends: 1264 [2025-01-09 19:20:33,478 INFO L226 Difference]: Without dead ends: 615 [2025-01-09 19:20:33,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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 19:20:33,494 INFO L435 NwaCegarLoop]: 884 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, 884 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 19:20:33,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-09 19:20:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-01-09 19:20:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 454 states have (on average 1.3722466960352422) internal successors, (623), 469 states have internal predecessors, (623), 119 states have call successors, (119), 41 states have call predecessors, (119), 40 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 19:20:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 860 transitions. [2025-01-09 19:20:33,595 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 860 transitions. Word has length 74 [2025-01-09 19:20:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:33,596 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 860 transitions. [2025-01-09 19:20:33,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 19:20:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 860 transitions. [2025-01-09 19:20:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 19:20:33,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:33,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:33,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 19:20:33,803 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 19:20:33,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:33,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1779200345, now seen corresponding path program 1 times [2025-01-09 19:20:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:33,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877089925] [2025-01-09 19:20:33,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:34,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 19:20:34,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 19:20:34,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:34,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 19:20:34,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877089925] [2025-01-09 19:20:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877089925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:20:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725366915] [2025-01-09 19:20:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:34,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:20:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:34,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:20:34,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:20:34,756 INFO L87 Difference]: Start difference. First operand 615 states and 860 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 19:20:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:34,928 INFO L93 Difference]: Finished difference Result 1448 states and 2004 transitions. [2025-01-09 19:20:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:20:34,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2025-01-09 19:20:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:34,942 INFO L225 Difference]: With dead ends: 1448 [2025-01-09 19:20:34,943 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 19:20:34,949 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 19:20:34,951 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 321 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:34,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1673 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:20:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 19:20:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 845. [2025-01-09 19:20:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 626 states have (on average 1.354632587859425) internal successors, (848), 643 states have internal predecessors, (848), 156 states have call successors, (156), 62 states have call predecessors, (156), 61 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 19:20:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1159 transitions. [2025-01-09 19:20:35,027 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1159 transitions. Word has length 74 [2025-01-09 19:20:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:35,028 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1159 transitions. [2025-01-09 19:20:35,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 19:20:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1159 transitions. [2025-01-09 19:20:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 19:20:35,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:35,037 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-01-09 19:20:35,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 19:20:35,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:35,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash 976124794, now seen corresponding path program 1 times [2025-01-09 19:20:35,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:35,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438815334] [2025-01-09 19:20:35,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 19:20:35,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 19:20:35,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:35,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 19:20:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438815334] [2025-01-09 19:20:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438815334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:36,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:20:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914699065] [2025-01-09 19:20:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:20:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:36,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:20:36,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:20:36,035 INFO L87 Difference]: Start difference. First operand 845 states and 1159 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 19:20:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:36,157 INFO L93 Difference]: Finished difference Result 1668 states and 2293 transitions. [2025-01-09 19:20:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:20:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 112 [2025-01-09 19:20:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:36,166 INFO L225 Difference]: With dead ends: 1668 [2025-01-09 19:20:36,166 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 19:20:36,169 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 19:20:36,171 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 6 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:36,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3412 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 19:20:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2025-01-09 19:20:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 629 states have (on average 1.3529411764705883) internal successors, (851), 646 states have internal predecessors, (851), 156 states have call successors, (156), 62 states have call predecessors, (156), 61 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 19:20:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1162 transitions. [2025-01-09 19:20:36,226 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1162 transitions. Word has length 112 [2025-01-09 19:20:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:36,227 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1162 transitions. [2025-01-09 19:20:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 19:20:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1162 transitions. [2025-01-09 19:20:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 19:20:36,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:36,231 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-01-09 19:20:36,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 19:20:36,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:36,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1509951552, now seen corresponding path program 1 times [2025-01-09 19:20:36,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:36,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004845969] [2025-01-09 19:20:36,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:36,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 19:20:36,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 19:20:36,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:36,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-09 19:20:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004845969] [2025-01-09 19:20:37,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004845969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:37,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:37,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:20:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129277136] [2025-01-09 19:20:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:37,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:20:37,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:37,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:20:37,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:20:37,048 INFO L87 Difference]: Start difference. First operand 848 states and 1162 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 19:20:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:37,085 INFO L93 Difference]: Finished difference Result 852 states and 1166 transitions. [2025-01-09 19:20:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:20:37,086 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 115 [2025-01-09 19:20:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:37,094 INFO L225 Difference]: With dead ends: 852 [2025-01-09 19:20:37,094 INFO L226 Difference]: Without dead ends: 849 [2025-01-09 19:20:37,095 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 19:20:37,095 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 0 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:37,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1712 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-01-09 19:20:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2025-01-09 19:20:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 630 states have (on average 1.3523809523809525) internal successors, (852), 647 states have internal predecessors, (852), 156 states have call successors, (156), 62 states have call predecessors, (156), 61 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 19:20:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1163 transitions. [2025-01-09 19:20:37,136 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1163 transitions. Word has length 115 [2025-01-09 19:20:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:37,139 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1163 transitions. [2025-01-09 19:20:37,139 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 19:20:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1163 transitions. [2025-01-09 19:20:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 19:20:37,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:37,142 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-01-09 19:20:37,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 19:20:37,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:37,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1114681883, now seen corresponding path program 1 times [2025-01-09 19:20:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:37,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410055983] [2025-01-09 19:20:37,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:37,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 19:20:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 19:20:37,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:37,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-09 19:20:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:37,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410055983] [2025-01-09 19:20:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410055983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:37,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:37,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 19:20:37,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838651663] [2025-01-09 19:20:37,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:37,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 19:20:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:37,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 19:20:37,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 19:20:37,897 INFO L87 Difference]: Start difference. First operand 849 states and 1163 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 19:20:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:37,968 INFO L93 Difference]: Finished difference Result 1768 states and 2422 transitions. [2025-01-09 19:20:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:20:37,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 117 [2025-01-09 19:20:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:37,978 INFO L225 Difference]: With dead ends: 1768 [2025-01-09 19:20:37,978 INFO L226 Difference]: Without dead ends: 946 [2025-01-09 19:20:37,982 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 19:20:37,984 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 651 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:37,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 2021 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-01-09 19:20:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 928. [2025-01-09 19:20:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 679 states have (on average 1.346097201767305) internal successors, (914), 704 states have internal predecessors, (914), 173 states have call successors, (173), 77 states have call predecessors, (173), 74 states have return successors, (177), 165 states have call predecessors, (177), 172 states have call successors, (177) [2025-01-09 19:20:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1264 transitions. [2025-01-09 19:20:38,032 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1264 transitions. Word has length 117 [2025-01-09 19:20:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:38,033 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1264 transitions. [2025-01-09 19:20:38,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 19:20:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1264 transitions. [2025-01-09 19:20:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 19:20:38,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:38,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:20:38,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 19:20:38,043 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:38,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:38,044 INFO L85 PathProgramCache]: Analyzing trace with hash 18168778, now seen corresponding path program 1 times [2025-01-09 19:20:38,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:38,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279184369] [2025-01-09 19:20:38,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:38,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:38,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 19:20:38,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 19:20:38,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:38,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-01-09 19:20:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279184369] [2025-01-09 19:20:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279184369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:20:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922555762] [2025-01-09 19:20:39,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:39,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:39,075 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 19:20:39,076 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 19:20:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 19:20:40,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 19:20:40,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:40,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:40,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 19:20:40,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:20:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 19:20:40,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:20:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922555762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:20:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 19:20:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990575945] [2025-01-09 19:20:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:40,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 19:20:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:40,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 19:20:40,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 19:20:40,723 INFO L87 Difference]: Start difference. First operand 928 states and 1264 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 19:20:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:40,822 INFO L93 Difference]: Finished difference Result 1835 states and 2507 transitions. [2025-01-09 19:20:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 19:20:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 217 [2025-01-09 19:20:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:40,831 INFO L225 Difference]: With dead ends: 1835 [2025-01-09 19:20:40,831 INFO L226 Difference]: Without dead ends: 934 [2025-01-09 19:20:40,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 19:20:40,837 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 3 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4264 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:40,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4264 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-01-09 19:20:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 933. [2025-01-09 19:20:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 683 states have (on average 1.3440702781844802) internal successors, (918), 707 states have internal predecessors, (918), 173 states have call successors, (173), 77 states have call predecessors, (173), 75 states have return successors, (181), 166 states have call predecessors, (181), 172 states have call successors, (181) [2025-01-09 19:20:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1272 transitions. [2025-01-09 19:20:40,882 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1272 transitions. Word has length 217 [2025-01-09 19:20:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:40,883 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1272 transitions. [2025-01-09 19:20:40,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 19:20:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1272 transitions. [2025-01-09 19:20:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 19:20:40,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:40,889 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:20:40,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 19:20:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:41,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1984776119, now seen corresponding path program 1 times [2025-01-09 19:20:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:41,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999578721] [2025-01-09 19:20:41,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:41,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 19:20:41,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 19:20:41,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:41,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-01-09 19:20:42,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999578721] [2025-01-09 19:20:42,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999578721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:20:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995634014] [2025-01-09 19:20:42,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:42,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:42,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:42,180 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 19:20:42,183 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 19:20:43,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 19:20:43,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 19:20:43,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:43,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:43,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 2767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 19:20:43,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:20:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 19:20:43,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:20:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995634014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:20:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 19:20:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429508382] [2025-01-09 19:20:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:43,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 19:20:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:43,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 19:20:43,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 19:20:43,736 INFO L87 Difference]: Start difference. First operand 933 states and 1272 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 19:20:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:43,869 INFO L93 Difference]: Finished difference Result 1842 states and 2517 transitions. [2025-01-09 19:20:43,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 19:20:43,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 217 [2025-01-09 19:20:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:43,878 INFO L225 Difference]: With dead ends: 1842 [2025-01-09 19:20:43,879 INFO L226 Difference]: Without dead ends: 936 [2025-01-09 19:20:43,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 19:20:43,884 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 2 mSDsluCounter, 5095 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5949 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:43,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5949 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:20:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-01-09 19:20:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2025-01-09 19:20:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 686 states have (on average 1.3425655976676385) internal successors, (921), 710 states have internal predecessors, (921), 173 states have call successors, (173), 77 states have call predecessors, (173), 75 states have return successors, (181), 166 states have call predecessors, (181), 172 states have call successors, (181) [2025-01-09 19:20:43,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1275 transitions. [2025-01-09 19:20:43,925 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1275 transitions. Word has length 217 [2025-01-09 19:20:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:43,926 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1275 transitions. [2025-01-09 19:20:43,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 19:20:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1275 transitions. [2025-01-09 19:20:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 19:20:43,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:43,934 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 19:20:43,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 19:20:44,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:44,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:44,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1225019407, now seen corresponding path program 1 times [2025-01-09 19:20:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183595821] [2025-01-09 19:20:44,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:44,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 19:20:44,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 19:20:44,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-01-09 19:20:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183595821] [2025-01-09 19:20:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183595821] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:20:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014577867] [2025-01-09 19:20:45,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:45,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:45,157 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 19:20:45,168 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 19:20:46,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 19:20:46,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 19:20:46,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:46,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:46,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 2925 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 19:20:46,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:20:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 19:20:46,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:20:46,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014577867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:46,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:20:46,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 19:20:46,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184307538] [2025-01-09 19:20:46,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:46,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 19:20:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:46,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 19:20:46,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 19:20:46,885 INFO L87 Difference]: Start difference. First operand 936 states and 1275 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 7 states have internal predecessors, (132), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 19:20:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:47,023 INFO L93 Difference]: Finished difference Result 1854 states and 2534 transitions. [2025-01-09 19:20:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 19:20:47,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 7 states have internal predecessors, (132), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) Word has length 233 [2025-01-09 19:20:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:47,031 INFO L225 Difference]: With dead ends: 1854 [2025-01-09 19:20:47,031 INFO L226 Difference]: Without dead ends: 945 [2025-01-09 19:20:47,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 19:20:47,036 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 4 mSDsluCounter, 5100 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5955 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:47,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5955 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:20:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-01-09 19:20:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 937. [2025-01-09 19:20:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 686 states have (on average 1.3425655976676385) internal successors, (921), 711 states have internal predecessors, (921), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 167 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:20:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1277 transitions. [2025-01-09 19:20:47,073 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1277 transitions. Word has length 233 [2025-01-09 19:20:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:47,075 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1277 transitions. [2025-01-09 19:20:47,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 7 states have internal predecessors, (132), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 4 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 19:20:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1277 transitions. [2025-01-09 19:20:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 19:20:47,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:47,084 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 19:20:47,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 19:20:47,285 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,SelfDestructingSolverStorable7 [2025-01-09 19:20:47,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:47,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash 8865681, now seen corresponding path program 1 times [2025-01-09 19:20:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:47,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175668045] [2025-01-09 19:20:47,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:47,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 19:20:47,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 19:20:47,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:47,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-01-09 19:20:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175668045] [2025-01-09 19:20:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175668045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 19:20:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615699251] [2025-01-09 19:20:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:48,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 19:20:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:48,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 19:20:48,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:20:48,114 INFO L87 Difference]: Start difference. First operand 937 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 19:20:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:48,195 INFO L93 Difference]: Finished difference Result 1854 states and 2535 transitions. [2025-01-09 19:20:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 19:20:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 233 [2025-01-09 19:20:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:48,206 INFO L225 Difference]: With dead ends: 1854 [2025-01-09 19:20:48,206 INFO L226 Difference]: Without dead ends: 944 [2025-01-09 19:20:48,211 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 19:20:48,213 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 3 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:48,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4267 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-01-09 19:20:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-01-09 19:20:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 690 states have (on average 1.3405797101449275) internal successors, (925), 714 states have internal predecessors, (925), 174 states have call successors, (174), 77 states have call predecessors, (174), 76 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2025-01-09 19:20:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1285 transitions. [2025-01-09 19:20:48,254 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1285 transitions. Word has length 233 [2025-01-09 19:20:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:48,256 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1285 transitions. [2025-01-09 19:20:48,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 19:20:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1285 transitions. [2025-01-09 19:20:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 19:20:48,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:48,267 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 19:20:48,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 19:20:48,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1075700875, now seen corresponding path program 1 times [2025-01-09 19:20:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630673879] [2025-01-09 19:20:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:48,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 19:20:48,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 19:20:48,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:48,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-09 19:20:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630673879] [2025-01-09 19:20:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630673879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:49,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:49,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 19:20:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961983842] [2025-01-09 19:20:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:49,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 19:20:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:49,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 19:20:49,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:20:49,352 INFO L87 Difference]: Start difference. First operand 942 states and 1285 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 19:20:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:49,438 INFO L93 Difference]: Finished difference Result 1860 states and 2543 transitions. [2025-01-09 19:20:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 19:20:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 249 [2025-01-09 19:20:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:49,448 INFO L225 Difference]: With dead ends: 1860 [2025-01-09 19:20:49,449 INFO L226 Difference]: Without dead ends: 945 [2025-01-09 19:20:49,454 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 19:20:49,454 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 1 mSDsluCounter, 3442 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4307 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:49,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4307 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-01-09 19:20:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 939. [2025-01-09 19:20:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 688 states have (on average 1.3415697674418605) internal successors, (923), 712 states have internal predecessors, (923), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:20:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1279 transitions. [2025-01-09 19:20:49,496 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1279 transitions. Word has length 249 [2025-01-09 19:20:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:49,496 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1279 transitions. [2025-01-09 19:20:49,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-01-09 19:20:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1279 transitions. [2025-01-09 19:20:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 19:20:49,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:49,505 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 19:20:49,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 19:20:49,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:49,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash 566227785, now seen corresponding path program 1 times [2025-01-09 19:20:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660604884] [2025-01-09 19:20:49,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:50,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 19:20:50,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 19:20:50,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:50,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-09 19:20:51,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660604884] [2025-01-09 19:20:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660604884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:20:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912055122] [2025-01-09 19:20:51,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:51,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:51,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:51,095 INFO L229 MonitoredProcess]: Starting monitored process 6 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 19:20:51,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 19:20:52,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 19:20:52,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 19:20:52,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:52,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:52,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 3077 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 19:20:52,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:20:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 19:20:52,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:20:52,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912055122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:52,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:20:52,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-01-09 19:20:52,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235528839] [2025-01-09 19:20:52,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:52,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:20:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:52,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:20:52,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 19:20:52,649 INFO L87 Difference]: Start difference. First operand 939 states and 1279 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 19:20:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:52,764 INFO L93 Difference]: Finished difference Result 1854 states and 2531 transitions. [2025-01-09 19:20:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:20:52,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 249 [2025-01-09 19:20:52,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:52,776 INFO L225 Difference]: With dead ends: 1854 [2025-01-09 19:20:52,777 INFO L226 Difference]: Without dead ends: 942 [2025-01-09 19:20:52,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 19:20:52,784 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 0 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:52,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3409 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:20:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-01-09 19:20:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 939. [2025-01-09 19:20:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 688 states have (on average 1.3415697674418605) internal successors, (923), 712 states have internal predecessors, (923), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:20:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1279 transitions. [2025-01-09 19:20:52,836 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1279 transitions. Word has length 249 [2025-01-09 19:20:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:52,839 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1279 transitions. [2025-01-09 19:20:52,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 19:20:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1279 transitions. [2025-01-09 19:20:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 19:20:52,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:52,850 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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 19:20:52,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 19:20:53,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 19:20:53,051 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:53,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1975979112, now seen corresponding path program 1 times [2025-01-09 19:20:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110772163] [2025-01-09 19:20:53,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:53,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 19:20:53,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 19:20:53,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:53,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:20:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110772163] [2025-01-09 19:20:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110772163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:53,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:53,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:20:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107707567] [2025-01-09 19:20:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:53,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:20:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:53,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:20:53,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:20:53,905 INFO L87 Difference]: Start difference. First operand 939 states and 1279 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 19:20:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:53,947 INFO L93 Difference]: Finished difference Result 1852 states and 2529 transitions. [2025-01-09 19:20:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:20:53,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 270 [2025-01-09 19:20:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:53,956 INFO L225 Difference]: With dead ends: 1852 [2025-01-09 19:20:53,956 INFO L226 Difference]: Without dead ends: 940 [2025-01-09 19:20:53,960 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 19:20:53,961 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 0 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:53,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1712 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-01-09 19:20:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2025-01-09 19:20:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 689 states have (on average 1.3410740203193032) internal successors, (924), 713 states have internal predecessors, (924), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:20:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1280 transitions. [2025-01-09 19:20:53,998 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1280 transitions. Word has length 270 [2025-01-09 19:20:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:53,999 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1280 transitions. [2025-01-09 19:20:53,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 19:20:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1280 transitions. [2025-01-09 19:20:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 19:20:54,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:54,006 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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 19:20:54,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 19:20:54,006 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:54,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1205245546, now seen corresponding path program 1 times [2025-01-09 19:20:54,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:54,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678721723] [2025-01-09 19:20:54,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 19:20:54,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 19:20:54,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:54,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:20:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678721723] [2025-01-09 19:20:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678721723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:20:54,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:20:54,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201513379] [2025-01-09 19:20:54,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:20:54,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:54,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:20:54,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:20:54,930 INFO L87 Difference]: Start difference. First operand 940 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 19:20:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:54,972 INFO L93 Difference]: Finished difference Result 1855 states and 2532 transitions. [2025-01-09 19:20:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:20:54,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 270 [2025-01-09 19:20:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:54,984 INFO L225 Difference]: With dead ends: 1855 [2025-01-09 19:20:54,984 INFO L226 Difference]: Without dead ends: 942 [2025-01-09 19:20:54,988 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 19:20:54,989 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:54,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1712 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:20:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-01-09 19:20:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 941. [2025-01-09 19:20:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 690 states have (on average 1.3405797101449275) internal successors, (925), 714 states have internal predecessors, (925), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:20:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1281 transitions. [2025-01-09 19:20:55,035 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1281 transitions. Word has length 270 [2025-01-09 19:20:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:55,036 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1281 transitions. [2025-01-09 19:20:55,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 19:20:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1281 transitions. [2025-01-09 19:20:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 19:20:55,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:55,044 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:20:55,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 19:20:55,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:55,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash 983205390, now seen corresponding path program 1 times [2025-01-09 19:20:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:55,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108466392] [2025-01-09 19:20:55,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:55,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 19:20:55,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 19:20:55,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:55,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:20:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:55,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108466392] [2025-01-09 19:20:55,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108466392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:20:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095025913] [2025-01-09 19:20:55,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:55,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:55,880 INFO L229 MonitoredProcess]: Starting monitored process 7 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 19:20:55,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 19:20:57,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 19:20:57,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 19:20:57,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:57,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:57,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 3194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 19:20:57,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:20:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 19:20:57,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:20:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095025913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:20:57,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:20:57,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 19:20:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168684564] [2025-01-09 19:20:57,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:20:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 19:20:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:20:57,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 19:20:57,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:20:57,524 INFO L87 Difference]: Start difference. First operand 941 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 19:20:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:20:57,680 INFO L93 Difference]: Finished difference Result 1857 states and 2534 transitions. [2025-01-09 19:20:57,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 19:20:57,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 272 [2025-01-09 19:20:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:20:57,703 INFO L225 Difference]: With dead ends: 1857 [2025-01-09 19:20:57,703 INFO L226 Difference]: Without dead ends: 943 [2025-01-09 19:20:57,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:20:57,709 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 1 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:20:57,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2561 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:20:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-01-09 19:20:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2025-01-09 19:20:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 692 states have (on average 1.3395953757225434) internal successors, (927), 716 states have internal predecessors, (927), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:20:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1283 transitions. [2025-01-09 19:20:57,767 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1283 transitions. Word has length 272 [2025-01-09 19:20:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:20:57,768 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1283 transitions. [2025-01-09 19:20:57,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 19:20:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1283 transitions. [2025-01-09 19:20:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 19:20:57,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:20:57,789 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:20:57,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 19:20:57,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 19:20:57,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:20:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:20:57,992 INFO L85 PathProgramCache]: Analyzing trace with hash 99696400, now seen corresponding path program 1 times [2025-01-09 19:20:57,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:20:57,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467321238] [2025-01-09 19:20:57,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:20:58,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 19:20:58,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 19:20:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:20:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:20:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:20:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:20:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467321238] [2025-01-09 19:20:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467321238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:20:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349612552] [2025-01-09 19:20:58,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:20:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:20:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:20:58,924 INFO L229 MonitoredProcess]: Starting monitored process 8 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 19:20:58,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 19:21:00,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 19:21:00,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 19:21:00,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:00,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:00,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 3197 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 19:21:00,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:21:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 19:21:00,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:21:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349612552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:21:00,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:21:00,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 19:21:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545870402] [2025-01-09 19:21:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:21:00,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 19:21:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:00,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 19:21:00,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:21:00,698 INFO L87 Difference]: Start difference. First operand 943 states and 1283 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 19:21:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:00,757 INFO L93 Difference]: Finished difference Result 1861 states and 2538 transitions. [2025-01-09 19:21:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 19:21:00,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 272 [2025-01-09 19:21:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:00,766 INFO L225 Difference]: With dead ends: 1861 [2025-01-09 19:21:00,766 INFO L226 Difference]: Without dead ends: 945 [2025-01-09 19:21:00,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 19:21:00,772 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 1 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:00,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2559 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:21:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-01-09 19:21:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2025-01-09 19:21:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 694 states have (on average 1.3386167146974064) internal successors, (929), 718 states have internal predecessors, (929), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:21:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1285 transitions. [2025-01-09 19:21:00,828 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1285 transitions. Word has length 272 [2025-01-09 19:21:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:00,828 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1285 transitions. [2025-01-09 19:21:00,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 19:21:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1285 transitions. [2025-01-09 19:21:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 19:21:00,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:00,835 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:21:00,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 19:21:01,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:01,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:01,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1451081618, now seen corresponding path program 1 times [2025-01-09 19:21:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314266378] [2025-01-09 19:21:01,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 19:21:01,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 19:21:01,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:01,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:21:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314266378] [2025-01-09 19:21:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314266378] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:21:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661021702] [2025-01-09 19:21:02,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:02,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:02,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:21:02,102 INFO L229 MonitoredProcess]: Starting monitored process 9 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 19:21:02,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 19:21:03,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 19:21:03,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 19:21:03,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:03,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:03,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 3200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 19:21:03,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:21:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-09 19:21:03,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 19:21:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:21:04,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661021702] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 19:21:04,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 19:21:04,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 19:21:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347057577] [2025-01-09 19:21:04,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 19:21:04,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 19:21:04,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:04,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 19:21:04,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:21:04,007 INFO L87 Difference]: Start difference. First operand 945 states and 1285 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 19:21:04,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:04,075 INFO L93 Difference]: Finished difference Result 1869 states and 2548 transitions. [2025-01-09 19:21:04,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 19:21:04,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 272 [2025-01-09 19:21:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:04,084 INFO L225 Difference]: With dead ends: 1869 [2025-01-09 19:21:04,085 INFO L226 Difference]: Without dead ends: 951 [2025-01-09 19:21:04,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 541 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 19:21:04,089 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 2 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3420 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 19:21:04,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3420 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:21:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-01-09 19:21:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2025-01-09 19:21:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 700 states have (on average 1.3357142857142856) internal successors, (935), 724 states have internal predecessors, (935), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:21:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1291 transitions. [2025-01-09 19:21:04,123 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1291 transitions. Word has length 272 [2025-01-09 19:21:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:04,124 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1291 transitions. [2025-01-09 19:21:04,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 19:21:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1291 transitions. [2025-01-09 19:21:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 19:21:04,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:04,132 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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 19:21:04,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 19:21:04,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 19:21:04,333 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:04,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash -281393794, now seen corresponding path program 2 times [2025-01-09 19:21:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:04,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543484038] [2025-01-09 19:21:04,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 19:21:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:04,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-01-09 19:21:04,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 278 statements. [2025-01-09 19:21:04,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 19:21:04,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 19:21:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543484038] [2025-01-09 19:21:05,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543484038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:21:05,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:21:05,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 19:21:05,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298323522] [2025-01-09 19:21:05,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:21:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 19:21:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:05,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 19:21:05,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 19:21:05,202 INFO L87 Difference]: Start difference. First operand 951 states and 1291 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 19:21:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:05,260 INFO L93 Difference]: Finished difference Result 1876 states and 2553 transitions. [2025-01-09 19:21:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 19:21:05,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 278 [2025-01-09 19:21:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:05,269 INFO L225 Difference]: With dead ends: 1876 [2025-01-09 19:21:05,270 INFO L226 Difference]: Without dead ends: 952 [2025-01-09 19:21:05,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:21:05,274 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 18 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:05,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2565 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:21:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-01-09 19:21:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 951. [2025-01-09 19:21:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 700 states have (on average 1.332857142857143) internal successors, (933), 724 states have internal predecessors, (933), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:21:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1289 transitions. [2025-01-09 19:21:05,322 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1289 transitions. Word has length 278 [2025-01-09 19:21:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:05,323 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1289 transitions. [2025-01-09 19:21:05,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 19:21:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1289 transitions. [2025-01-09 19:21:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-01-09 19:21:05,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:05,331 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:21:05,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 19:21:05,332 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:05,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1810271649, now seen corresponding path program 1 times [2025-01-09 19:21:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498597202] [2025-01-09 19:21:05,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:05,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-09 19:21:06,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-09 19:21:06,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:06,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:21:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498597202] [2025-01-09 19:21:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498597202] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:21:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456321049] [2025-01-09 19:21:06,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:06,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:06,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:21:06,379 INFO L229 MonitoredProcess]: Starting monitored process 10 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 19:21:06,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 19:21:07,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-09 19:21:08,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-09 19:21:08,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:08,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:08,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 3251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 19:21:08,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:21:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 64 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-09 19:21:08,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 19:21:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:21:08,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456321049] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 19:21:08,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 19:21:08,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 19:21:08,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562151643] [2025-01-09 19:21:08,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 19:21:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 19:21:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:08,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 19:21:08,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 19:21:08,522 INFO L87 Difference]: Start difference. First operand 951 states and 1289 transitions. Second operand has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 19:21:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:08,632 INFO L93 Difference]: Finished difference Result 1887 states and 2565 transitions. [2025-01-09 19:21:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 19:21:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 280 [2025-01-09 19:21:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:08,641 INFO L225 Difference]: With dead ends: 1887 [2025-01-09 19:21:08,641 INFO L226 Difference]: Without dead ends: 963 [2025-01-09 19:21:08,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 19:21:08,646 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 2 mSDsluCounter, 4260 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5116 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:08,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5116 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:21:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-01-09 19:21:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-01-09 19:21:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 712 states have (on average 1.327247191011236) internal successors, (945), 736 states have internal predecessors, (945), 174 states have call successors, (174), 77 states have call predecessors, (174), 75 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2025-01-09 19:21:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1301 transitions. [2025-01-09 19:21:08,685 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1301 transitions. Word has length 280 [2025-01-09 19:21:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:08,687 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1301 transitions. [2025-01-09 19:21:08,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 19:21:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1301 transitions. [2025-01-09 19:21:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 19:21:08,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:08,693 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:21:08,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 19:21:08,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 19:21:08,895 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:08,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash 966402169, now seen corresponding path program 2 times [2025-01-09 19:21:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:08,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106929737] [2025-01-09 19:21:08,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 19:21:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:09,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 292 statements into 2 equivalence classes. [2025-01-09 19:21:09,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 292 statements. [2025-01-09 19:21:09,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 19:21:09,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-01-09 19:21:09,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:09,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106929737] [2025-01-09 19:21:09,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106929737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:21:09,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:21:09,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:21:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932719970] [2025-01-09 19:21:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:21:09,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:21:09,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:09,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:21:09,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:21:09,870 INFO L87 Difference]: Start difference. First operand 963 states and 1301 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 19:21:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:10,060 INFO L93 Difference]: Finished difference Result 1905 states and 2589 transitions. [2025-01-09 19:21:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:21:10,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 292 [2025-01-09 19:21:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:10,069 INFO L225 Difference]: With dead ends: 1905 [2025-01-09 19:21:10,069 INFO L226 Difference]: Without dead ends: 969 [2025-01-09 19:21:10,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:21:10,074 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 0 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:10,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3426 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:21:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-01-09 19:21:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 967. [2025-01-09 19:21:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 715 states have (on average 1.3258741258741258) internal successors, (948), 739 states have internal predecessors, (948), 174 states have call successors, (174), 77 states have call predecessors, (174), 76 states have return successors, (184), 169 states have call predecessors, (184), 173 states have call successors, (184) [2025-01-09 19:21:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1306 transitions. [2025-01-09 19:21:10,137 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1306 transitions. Word has length 292 [2025-01-09 19:21:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1306 transitions. [2025-01-09 19:21:10,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 19:21:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1306 transitions. [2025-01-09 19:21:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 19:21:10,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:10,143 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:21:10,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 19:21:10,143 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:10,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash 21327585, now seen corresponding path program 1 times [2025-01-09 19:21:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075350359] [2025-01-09 19:21:10,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:10,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 19:21:10,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 19:21:10,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:10,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 3 proven. 100 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:21:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:11,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075350359] [2025-01-09 19:21:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075350359] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:21:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197355646] [2025-01-09 19:21:11,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:11,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:11,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:21:11,515 INFO L229 MonitoredProcess]: Starting monitored process 11 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 19:21:11,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 19:21:12,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 19:21:13,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 19:21:13,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:13,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:13,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 3379 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 19:21:13,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:21:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 64 proven. 100 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-01-09 19:21:13,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 19:21:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 3 proven. 100 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 19:21:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197355646] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 19:21:13,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 19:21:13,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 19:21:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274737933] [2025-01-09 19:21:13,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 19:21:13,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 19:21:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:13,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 19:21:13,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 19:21:13,837 INFO L87 Difference]: Start difference. First operand 967 states and 1306 transitions. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 19:21:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:13,973 INFO L93 Difference]: Finished difference Result 1931 states and 2617 transitions. [2025-01-09 19:21:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 19:21:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 292 [2025-01-09 19:21:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:13,982 INFO L225 Difference]: With dead ends: 1931 [2025-01-09 19:21:13,982 INFO L226 Difference]: Without dead ends: 991 [2025-01-09 19:21:13,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 19:21:13,988 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 2 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:13,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3412 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:21:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-09 19:21:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-01-09 19:21:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 739 states have (on average 1.3152909336941814) internal successors, (972), 763 states have internal predecessors, (972), 174 states have call successors, (174), 77 states have call predecessors, (174), 76 states have return successors, (184), 169 states have call predecessors, (184), 173 states have call successors, (184) [2025-01-09 19:21:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1330 transitions. [2025-01-09 19:21:14,025 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1330 transitions. Word has length 292 [2025-01-09 19:21:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:14,026 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1330 transitions. [2025-01-09 19:21:14,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 19:21:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1330 transitions. [2025-01-09 19:21:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-01-09 19:21:14,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:14,031 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:21:14,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 19:21:14,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:14,232 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:14,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1681085295, now seen corresponding path program 2 times [2025-01-09 19:21:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:14,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559394132] [2025-01-09 19:21:14,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 19:21:14,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:14,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 316 statements into 2 equivalence classes. [2025-01-09 19:21:14,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 316 statements. [2025-01-09 19:21:14,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 19:21:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-01-09 19:21:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:15,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559394132] [2025-01-09 19:21:15,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559394132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:21:15,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:21:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 19:21:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848440353] [2025-01-09 19:21:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:21:15,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 19:21:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:15,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 19:21:15,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 19:21:15,435 INFO L87 Difference]: Start difference. First operand 991 states and 1330 transitions. Second operand has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 7 states have internal predecessors, (149), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 19:21:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:15,741 INFO L93 Difference]: Finished difference Result 2009 states and 2715 transitions. [2025-01-09 19:21:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 19:21:15,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 7 states have internal predecessors, (149), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) Word has length 316 [2025-01-09 19:21:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:15,750 INFO L225 Difference]: With dead ends: 2009 [2025-01-09 19:21:15,750 INFO L226 Difference]: Without dead ends: 1045 [2025-01-09 19:21:15,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 19:21:15,756 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 11 mSDsluCounter, 5946 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6797 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:15,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6797 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:21:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-01-09 19:21:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1007. [2025-01-09 19:21:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 753 states have (on average 1.3147410358565736) internal successors, (990), 777 states have internal predecessors, (990), 175 states have call successors, (175), 77 states have call predecessors, (175), 77 states have return successors, (188), 171 states have call predecessors, (188), 174 states have call successors, (188) [2025-01-09 19:21:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1353 transitions. [2025-01-09 19:21:15,794 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1353 transitions. Word has length 316 [2025-01-09 19:21:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:15,795 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1353 transitions. [2025-01-09 19:21:15,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 7 states have internal predecessors, (149), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 5 states have call predecessors, (28), 3 states have call successors, (28) [2025-01-09 19:21:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1353 transitions. [2025-01-09 19:21:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-09 19:21:15,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:15,801 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1] [2025-01-09 19:21:15,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 19:21:15,801 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:15,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2146054495, now seen corresponding path program 1 times [2025-01-09 19:21:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116987710] [2025-01-09 19:21:15,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:16,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-09 19:21:16,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-09 19:21:16,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:16,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 3 proven. 484 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-09 19:21:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:18,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116987710] [2025-01-09 19:21:18,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116987710] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:21:18,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549280986] [2025-01-09 19:21:18,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:18,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:18,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:21:18,469 INFO L229 MonitoredProcess]: Starting monitored process 12 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 19:21:18,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 19:21:20,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-09 19:21:20,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-09 19:21:20,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:20,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:20,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 3717 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 19:21:20,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:21:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 140 proven. 484 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-01-09 19:21:20,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 19:21:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 3 proven. 484 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-09 19:21:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549280986] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 19:21:21,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 19:21:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 33 [2025-01-09 19:21:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098588289] [2025-01-09 19:21:21,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 19:21:21,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 19:21:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:21,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 19:21:21,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 19:21:21,439 INFO L87 Difference]: Start difference. First operand 1007 states and 1353 transitions. Second operand has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 19:21:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:21,642 INFO L93 Difference]: Finished difference Result 2003 states and 2699 transitions. [2025-01-09 19:21:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 19:21:21,647 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 356 [2025-01-09 19:21:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:21,655 INFO L225 Difference]: With dead ends: 2003 [2025-01-09 19:21:21,655 INFO L226 Difference]: Without dead ends: 1023 [2025-01-09 19:21:21,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 688 SyntacticMatches, 16 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 19:21:21,660 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 1 mSDsluCounter, 4260 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:21,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:21:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-01-09 19:21:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2025-01-09 19:21:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 769 states have (on average 1.3081924577373212) internal successors, (1006), 793 states have internal predecessors, (1006), 175 states have call successors, (175), 77 states have call predecessors, (175), 77 states have return successors, (188), 171 states have call predecessors, (188), 174 states have call successors, (188) [2025-01-09 19:21:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1369 transitions. [2025-01-09 19:21:21,692 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1369 transitions. Word has length 356 [2025-01-09 19:21:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:21,693 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1369 transitions. [2025-01-09 19:21:21,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 19:21:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1369 transitions. [2025-01-09 19:21:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 19:21:21,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:21,699 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1] [2025-01-09 19:21:21,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 19:21:21,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 19:21:21,900 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 893750399, now seen corresponding path program 2 times [2025-01-09 19:21:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:21,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717333527] [2025-01-09 19:21:21,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 19:21:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:22,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 372 statements into 2 equivalence classes. [2025-01-09 19:21:22,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 372 statements. [2025-01-09 19:21:22,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 19:21:22,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2025-01-09 19:21:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717333527] [2025-01-09 19:21:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717333527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:21:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:21:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 19:21:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212319233] [2025-01-09 19:21:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:21:22,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 19:21:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:22,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 19:21:22,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 19:21:22,747 INFO L87 Difference]: Start difference. First operand 1023 states and 1369 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:21:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:22,820 INFO L93 Difference]: Finished difference Result 2028 states and 2768 transitions. [2025-01-09 19:21:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:21:22,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 372 [2025-01-09 19:21:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:22,831 INFO L225 Difference]: With dead ends: 2028 [2025-01-09 19:21:22,831 INFO L226 Difference]: Without dead ends: 1032 [2025-01-09 19:21:22,836 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 19:21:22,836 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 4 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:22,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2554 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:21:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-01-09 19:21:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1031. [2025-01-09 19:21:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 775 states have (on average 1.3096774193548386) internal successors, (1015), 800 states have internal predecessors, (1015), 175 states have call successors, (175), 78 states have call predecessors, (175), 79 states have return successors, (192), 171 states have call predecessors, (192), 174 states have call successors, (192) [2025-01-09 19:21:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1382 transitions. [2025-01-09 19:21:22,870 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1382 transitions. Word has length 372 [2025-01-09 19:21:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:22,871 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1382 transitions. [2025-01-09 19:21:22,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:21:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1382 transitions. [2025-01-09 19:21:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 19:21:22,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:22,877 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1] [2025-01-09 19:21:22,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 19:21:22,877 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:22,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -389797687, now seen corresponding path program 1 times [2025-01-09 19:21:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308172739] [2025-01-09 19:21:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:21:23,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 19:21:23,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 19:21:23,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:23,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2025-01-09 19:21:24,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:21:24,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308172739] [2025-01-09 19:21:24,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308172739] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 19:21:24,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2283721] [2025-01-09 19:21:24,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:24,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:24,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:21:24,703 INFO L229 MonitoredProcess]: Starting monitored process 13 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 19:21:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 19:21:26,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 19:21:26,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 19:21:26,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:21:26,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:21:26,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 3883 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 19:21:26,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 19:21:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1178 trivial. 0 not checked. [2025-01-09 19:21:26,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 19:21:26,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2283721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:21:26,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 19:21:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 19:21:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491447409] [2025-01-09 19:21:26,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:21:26,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 19:21:26,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:21:26,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 19:21:26,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 19:21:26,868 INFO L87 Difference]: Start difference. First operand 1031 states and 1382 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 5 states have call successors, (31) [2025-01-09 19:21:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:21:27,237 INFO L93 Difference]: Finished difference Result 2083 states and 2807 transitions. [2025-01-09 19:21:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 19:21:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 5 states have call successors, (31) Word has length 374 [2025-01-09 19:21:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:21:27,246 INFO L225 Difference]: With dead ends: 2083 [2025-01-09 19:21:27,246 INFO L226 Difference]: Without dead ends: 1059 [2025-01-09 19:21:27,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 19:21:27,250 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 16 mSDsluCounter, 3380 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 19:21:27,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4235 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 19:21:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-01-09 19:21:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1038. [2025-01-09 19:21:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 781 states have (on average 1.3085787451984634) internal successors, (1022), 807 states have internal predecessors, (1022), 175 states have call successors, (175), 78 states have call predecessors, (175), 80 states have return successors, (193), 171 states have call predecessors, (193), 174 states have call successors, (193) [2025-01-09 19:21:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1390 transitions. [2025-01-09 19:21:27,283 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1390 transitions. Word has length 374 [2025-01-09 19:21:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:21:27,283 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1390 transitions. [2025-01-09 19:21:27,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 5 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (31), 4 states have call predecessors, (31), 5 states have call successors, (31) [2025-01-09 19:21:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1390 transitions. [2025-01-09 19:21:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-01-09 19:21:27,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:21:27,290 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1, 1] [2025-01-09 19:21:27,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 19:21:27,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 19:21:27,492 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-01-09 19:21:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:21:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash -751084407, now seen corresponding path program 1 times [2025-01-09 19:21:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:21:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246046839] [2025-01-09 19:21:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:21:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms