./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-multidimensional/copy-3-n-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:27:40,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:27:40,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:27:40,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:27:40,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:27:40,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:27:40,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:27:40,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:27:40,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:27:40,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:27:40,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:27:40,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:27:40,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:27:40,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:27:40,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:27:40,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:27:40,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:40,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:40,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:27:40,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:27:40,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:27:40,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:27:40,089 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 [2025-01-08 22:27:40,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:27:40,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:27:40,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:27:40,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:27:40,271 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:27:40,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2025-01-08 22:27:41,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/996068001/4120b5373a0543efa4fd5d112044a6ec/FLAGfda07bc61 [2025-01-08 22:27:41,742 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:27:41,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2025-01-08 22:27:41,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/996068001/4120b5373a0543efa4fd5d112044a6ec/FLAGfda07bc61 [2025-01-08 22:27:42,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/996068001/4120b5373a0543efa4fd5d112044a6ec [2025-01-08 22:27:42,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:27:42,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:27:42,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:27:42,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:27:42,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:27:42,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2659f3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42, skipping insertion in model container [2025-01-08 22:27:42,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:27:42,159 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/array-multidimensional/copy-3-n-u.c[322,335] [2025-01-08 22:27:42,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:27:42,184 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:27:42,191 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/array-multidimensional/copy-3-n-u.c[322,335] [2025-01-08 22:27:42,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:27:42,210 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:27:42,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42 WrapperNode [2025-01-08 22:27:42,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:27:42,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:27:42,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:27:42,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:27:42,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,229 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-01-08 22:27:42,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:27:42,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:27:42,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:27:42,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:27:42,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,243 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-08 22:27:42,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:27:42,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:27:42,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:27:42,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:27:42,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (1/1) ... [2025-01-08 22:27:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:27:42,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:42,283 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-08 22:27:42,286 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-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:27:42,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:27:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:27:42,390 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:27:42,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:27:42,524 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-01-08 22:27:42,525 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:27:42,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:27:42,531 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:27:42,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:27:42 BoogieIcfgContainer [2025-01-08 22:27:42,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:27:42,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:27:42,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:27:42,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:27:42,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:27:42" (1/3) ... [2025-01-08 22:27:42,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570ec1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:27:42, skipping insertion in model container [2025-01-08 22:27:42,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:27:42" (2/3) ... [2025-01-08 22:27:42,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570ec1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:27:42, skipping insertion in model container [2025-01-08 22:27:42,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:27:42" (3/3) ... [2025-01-08 22:27:42,543 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-3-n-u.c [2025-01-08 22:27:42,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:27:42,555 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-3-n-u.c that has 1 procedures, 18 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-01-08 22:27:42,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:27:42,605 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;@3cc398da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:27:42,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:27:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-08 22:27:42,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:42,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:42,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:42,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:42,618 INFO L85 PathProgramCache]: Analyzing trace with hash 692460059, now seen corresponding path program 1 times [2025-01-08 22:27:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886643829] [2025-01-08 22:27:42,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:42,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:42,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-08 22:27:42,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-08 22:27:42,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:42,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:27:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886643829] [2025-01-08 22:27:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886643829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:27:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796905252] [2025-01-08 22:27:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:42,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:27:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:42,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:27:42,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:27:42,839 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:42,869 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2025-01-08 22:27:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:27:42,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-08 22:27:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:42,879 INFO L225 Difference]: With dead ends: 34 [2025-01-08 22:27:42,879 INFO L226 Difference]: Without dead ends: 18 [2025-01-08 22:27:42,885 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-08 22:27:42,887 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:42,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-08 22:27:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-01-08 22:27:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-01-08 22:27:42,910 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 9 [2025-01-08 22:27:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:42,910 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-01-08 22:27:42,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2025-01-08 22:27:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-08 22:27:42,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:42,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:42,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:27:42,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:42,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash 485398671, now seen corresponding path program 1 times [2025-01-08 22:27:42,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:42,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208463985] [2025-01-08 22:27:42,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:42,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-08 22:27:42,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-08 22:27:42,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:42,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:27:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208463985] [2025-01-08 22:27:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208463985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386165928] [2025-01-08 22:27:43,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:43,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:43,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:43,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:43,003 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:43,049 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2025-01-08 22:27:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:43,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-08 22:27:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:43,050 INFO L225 Difference]: With dead ends: 39 [2025-01-08 22:27:43,050 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:27:43,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:43,050 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:43,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:27:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2025-01-08 22:27:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2025-01-08 22:27:43,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 11 [2025-01-08 22:27:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:43,055 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2025-01-08 22:27:43,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2025-01-08 22:27:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:27:43,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:43,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:43,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:27:43,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash -254666987, now seen corresponding path program 1 times [2025-01-08 22:27:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112517967] [2025-01-08 22:27:43,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:43,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:27:43,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:27:43,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:43,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:27:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112517967] [2025-01-08 22:27:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112517967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099999959] [2025-01-08 22:27:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:43,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:43,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:43,120 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:43,148 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2025-01-08 22:27:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:27:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:43,149 INFO L225 Difference]: With dead ends: 42 [2025-01-08 22:27:43,149 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:27:43,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:43,150 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:43,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:27:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-01-08 22:27:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-01-08 22:27:43,155 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 13 [2025-01-08 22:27:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:43,155 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-01-08 22:27:43,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2025-01-08 22:27:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:27:43,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:43,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:43,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:27:43,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:43,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1990923851, now seen corresponding path program 1 times [2025-01-08 22:27:43,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:43,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000554947] [2025-01-08 22:27:43,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:43,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:27:43,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:27:43,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:43,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:27:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000554947] [2025-01-08 22:27:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000554947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:27:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:27:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:27:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705785444] [2025-01-08 22:27:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:27:43,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:27:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:43,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:27:43,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:43,232 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:43,265 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-01-08 22:27:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:27:43,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-08 22:27:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:43,266 INFO L225 Difference]: With dead ends: 49 [2025-01-08 22:27:43,266 INFO L226 Difference]: Without dead ends: 40 [2025-01-08 22:27:43,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:27:43,267 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:43,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-08 22:27:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2025-01-08 22:27:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-01-08 22:27:43,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2025-01-08 22:27:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:43,273 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-01-08 22:27:43,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-01-08 22:27:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:27:43,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:43,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:43,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:27:43,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:43,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1089748445, now seen corresponding path program 1 times [2025-01-08 22:27:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261181891] [2025-01-08 22:27:43,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:43,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:27:43,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:27:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:27:43,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:43,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261181891] [2025-01-08 22:27:43,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261181891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:43,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309160388] [2025-01-08 22:27:43,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:27:43,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:43,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:43,347 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-08 22:27:43,349 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-08 22:27:43,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:27:43,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:27:43,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:27:43,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:27:43,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:27:43,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:27:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309160388] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:43,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 22:27:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157607926] [2025-01-08 22:27:43,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:43,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:27:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:43,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:27:43,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:27:43,489 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:43,569 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2025-01-08 22:27:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:27:43,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-08 22:27:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:43,569 INFO L225 Difference]: With dead ends: 64 [2025-01-08 22:27:43,569 INFO L226 Difference]: Without dead ends: 44 [2025-01-08 22:27:43,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:27:43,570 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 94 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:43,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 53 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:27:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-08 22:27:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-01-08 22:27:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-01-08 22:27:43,577 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2025-01-08 22:27:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:43,577 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-01-08 22:27:43,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-01-08 22:27:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:27:43,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:43,579 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:43,587 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-08 22:27:43,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:43,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:43,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1510829093, now seen corresponding path program 2 times [2025-01-08 22:27:43,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:43,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11964149] [2025-01-08 22:27:43,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:27:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:43,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:27:43,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:27:43,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:27:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 22:27:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11964149] [2025-01-08 22:27:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11964149] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253335563] [2025-01-08 22:27:43,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:27:43,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:43,943 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-08 22:27:43,944 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-08 22:27:43,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:27:44,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:27:44,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:27:44,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:44,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:27:44,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:27:44,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:27:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253335563] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:44,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:44,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-01-08 22:27:44,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805043791] [2025-01-08 22:27:44,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:44,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:27:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:44,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:27:44,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:27:44,155 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:44,625 INFO L93 Difference]: Finished difference Result 148 states and 202 transitions. [2025-01-08 22:27:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-08 22:27:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:27:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:44,626 INFO L225 Difference]: With dead ends: 148 [2025-01-08 22:27:44,626 INFO L226 Difference]: Without dead ends: 113 [2025-01-08 22:27:44,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-01-08 22:27:44,628 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 268 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:44,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 63 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:27:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-08 22:27:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2025-01-08 22:27:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2025-01-08 22:27:44,660 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 25 [2025-01-08 22:27:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:44,660 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2025-01-08 22:27:44,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2025-01-08 22:27:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 22:27:44,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:44,661 INFO L218 NwaCegarLoop]: trace histogram [20, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:44,670 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-08 22:27:44,866 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-08 22:27:44,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:44,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1483394411, now seen corresponding path program 3 times [2025-01-08 22:27:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:44,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020487496] [2025-01-08 22:27:44,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:27:44,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:44,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 15 equivalence classes. [2025-01-08 22:27:44,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 51 statements. [2025-01-08 22:27:44,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:27:44,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-08 22:27:44,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020487496] [2025-01-08 22:27:44,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020487496] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046316400] [2025-01-08 22:27:44,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:27:44,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:44,923 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-08 22:27:44,925 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-08 22:27:44,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 15 equivalence classes. [2025-01-08 22:27:44,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 51 statements. [2025-01-08 22:27:44,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:27:44,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:44,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:27:44,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-08 22:27:45,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:27:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-08 22:27:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046316400] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:27:45,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:27:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 22:27:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242575594] [2025-01-08 22:27:45,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:27:45,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:27:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:27:45,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:27:45,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:27:45,138 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:27:45,239 INFO L93 Difference]: Finished difference Result 312 states and 393 transitions. [2025-01-08 22:27:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:27:45,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-08 22:27:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:27:45,243 INFO L225 Difference]: With dead ends: 312 [2025-01-08 22:27:45,243 INFO L226 Difference]: Without dead ends: 261 [2025-01-08 22:27:45,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:27:45,244 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:27:45,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 44 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:27:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-08 22:27:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 152. [2025-01-08 22:27:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2025-01-08 22:27:45,289 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 51 [2025-01-08 22:27:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:27:45,290 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2025-01-08 22:27:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:27:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2025-01-08 22:27:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-08 22:27:45,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:27:45,294 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:27:45,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:27:45,498 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-08 22:27:45,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:27:45,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:27:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash -891125221, now seen corresponding path program 4 times [2025-01-08 22:27:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:27:45,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252220051] [2025-01-08 22:27:45,499 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:27:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:27:45,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 121 statements into 2 equivalence classes. [2025-01-08 22:27:45,641 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-01-08 22:27:45,641 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:27:45,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 379 proven. 1 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2025-01-08 22:27:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:27:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252220051] [2025-01-08 22:27:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252220051] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:27:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012400584] [2025-01-08 22:27:45,837 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:27:45,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:27:45,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:27:45,839 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-08 22:27:45,840 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-08 22:27:45,949 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 121 statements into 2 equivalence classes. [2025-01-08 22:27:46,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 79 of 121 statements. [2025-01-08 22:27:46,266 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:27:46,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:27:46,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 183 conjuncts are in the unsatisfiable core [2025-01-08 22:27:46,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:27:46,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-08 22:27:46,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2025-01-08 22:27:46,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:46,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2025-01-08 22:27:46,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:46,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 66 [2025-01-08 22:27:46,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:46,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 84 [2025-01-08 22:27:46,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:46,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 102 [2025-01-08 22:27:46,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:46,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 120 [2025-01-08 22:27:46,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:46,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 121 treesize of output 138 [2025-01-08 22:27:47,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:47,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 156 [2025-01-08 22:27:47,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:27:47,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 151 treesize of output 174 [2025-01-08 22:27:47,621 INFO L349 Elim1Store]: treesize reduction 258, result has 25.6 percent of original size [2025-01-08 22:27:47,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 170 treesize of output 196 [2025-01-08 22:27:47,840 INFO L349 Elim1Store]: treesize reduction 352, result has 20.2 percent of original size [2025-01-08 22:27:47,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 191 treesize of output 220 [2025-01-08 22:27:48,110 INFO L349 Elim1Store]: treesize reduction 438, result has 16.9 percent of original size [2025-01-08 22:27:48,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 76 case distinctions, treesize of input 212 treesize of output 244 [2025-01-08 22:27:48,413 INFO L349 Elim1Store]: treesize reduction 526, result has 14.5 percent of original size [2025-01-08 22:27:48,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 88 case distinctions, treesize of input 233 treesize of output 268 [2025-01-08 22:27:48,740 INFO L349 Elim1Store]: treesize reduction 616, result has 12.6 percent of original size [2025-01-08 22:27:48,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 101 case distinctions, treesize of input 254 treesize of output 292 [2025-01-08 22:27:49,109 INFO L349 Elim1Store]: treesize reduction 708, result has 11.2 percent of original size [2025-01-08 22:27:49,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 115 case distinctions, treesize of input 275 treesize of output 316 [2025-01-08 22:27:49,526 INFO L349 Elim1Store]: treesize reduction 802, result has 10.0 percent of original size [2025-01-08 22:27:49,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 130 case distinctions, treesize of input 296 treesize of output 340 [2025-01-08 22:27:50,042 INFO L349 Elim1Store]: treesize reduction 898, result has 9.0 percent of original size [2025-01-08 22:27:50,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 146 case distinctions, treesize of input 317 treesize of output 364 [2025-01-08 22:27:50,574 INFO L349 Elim1Store]: treesize reduction 996, result has 8.2 percent of original size [2025-01-08 22:27:50,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 163 case distinctions, treesize of input 338 treesize of output 388 [2025-01-08 22:27:51,194 INFO L349 Elim1Store]: treesize reduction 1096, result has 7.5 percent of original size [2025-01-08 22:27:51,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 181 case distinctions, treesize of input 359 treesize of output 412 [2025-01-08 22:27:52,686 INFO L349 Elim1Store]: treesize reduction 1307, result has 11.1 percent of original size [2025-01-08 22:27:52,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 205 case distinctions, treesize of input 378 treesize of output 434 [2025-01-08 22:27:53,503 INFO L349 Elim1Store]: treesize reduction 1448, result has 10.2 percent of original size [2025-01-08 22:27:53,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 225 case distinctions, treesize of input 399 treesize of output 458 [2025-01-08 22:27:54,449 INFO L349 Elim1Store]: treesize reduction 1576, result has 9.4 percent of original size [2025-01-08 22:27:54,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 246 case distinctions, treesize of input 420 treesize of output 482 [2025-01-08 22:27:55,485 INFO L349 Elim1Store]: treesize reduction 1708, result has 8.8 percent of original size [2025-01-08 22:27:55,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 268 case distinctions, treesize of input 441 treesize of output 506 [2025-01-08 22:27:57,124 INFO L349 Elim1Store]: treesize reduction 2240, result has 10.2 percent of original size [2025-01-08 22:27:57,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 300 case distinctions, treesize of input 466 treesize of output 534 [2025-01-08 22:27:59,013 INFO L349 Elim1Store]: treesize reduction 2526, result has 9.6 percent of original size [2025-01-08 22:27:59,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 325 case distinctions, treesize of input 491 treesize of output 562 [2025-01-08 22:28:01,235 INFO L349 Elim1Store]: treesize reduction 2820, result has 9.1 percent of original size [2025-01-08 22:28:01,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 26 select indices, 26 select index equivalence classes, 0 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 351 case distinctions, treesize of input 516 treesize of output 590 [2025-01-08 22:28:03,542 INFO L349 Elim1Store]: treesize reduction 3122, result has 8.7 percent of original size [2025-01-08 22:28:03,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 27 select indices, 27 select index equivalence classes, 0 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 378 case distinctions, treesize of input 541 treesize of output 618 [2025-01-08 22:28:06,279 INFO L349 Elim1Store]: treesize reduction 3432, result has 8.3 percent of original size [2025-01-08 22:28:06,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 28 select indices, 28 select index equivalence classes, 0 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 406 case distinctions, treesize of input 566 treesize of output 646 [2025-01-08 22:28:09,719 INFO L349 Elim1Store]: treesize reduction 3750, result has 8.0 percent of original size [2025-01-08 22:28:09,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 29 select indices, 29 select index equivalence classes, 0 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 435 case distinctions, treesize of input 591 treesize of output 674 [2025-01-08 22:28:14,482 INFO L349 Elim1Store]: treesize reduction 3565, result has 5.9 percent of original size [2025-01-08 22:28:14,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 454 case distinctions, treesize of input 610 treesize of output 696 [2025-01-08 22:28:18,262 INFO L349 Elim1Store]: treesize reduction 4339, result has 7.5 percent of original size [2025-01-08 22:28:18,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 31 select indices, 31 select index equivalence classes, 0 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 496 case distinctions, treesize of input 635 treesize of output 724 [2025-01-08 22:28:23,101 INFO L349 Elim1Store]: treesize reduction 4721, result has 7.2 percent of original size [2025-01-08 22:28:23,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 32 select indices, 32 select index equivalence classes, 0 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 528 case distinctions, treesize of input 660 treesize of output 752 [2025-01-08 22:28:28,080 INFO L349 Elim1Store]: treesize reduction 5111, result has 6.9 percent of original size [2025-01-08 22:28:28,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 33 select indices, 33 select index equivalence classes, 0 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 561 case distinctions, treesize of input 685 treesize of output 780 [2025-01-08 22:28:33,720 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 1820 DAG size of output: 171 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-08 22:28:33,720 INFO L349 Elim1Store]: treesize reduction 5509, result has 6.6 percent of original size [2025-01-08 22:28:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 595 case distinctions, treesize of input 710 treesize of output 808 [2025-01-08 22:28:40,750 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 1970 DAG size of output: 177 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-08 22:28:40,750 INFO L349 Elim1Store]: treesize reduction 5915, result has 6.4 percent of original size [2025-01-08 22:28:40,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 35 select indices, 35 select index equivalence classes, 0 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 630 case distinctions, treesize of input 735 treesize of output 836 [2025-01-08 22:28:48,336 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 2124 DAG size of output: 183 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-08 22:28:48,336 INFO L349 Elim1Store]: treesize reduction 6329, result has 6.2 percent of original size [2025-01-08 22:28:48,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 36 select indices, 36 select index equivalence classes, 0 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 666 case distinctions, treesize of input 760 treesize of output 864 [2025-01-08 22:28:57,037 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 2282 DAG size of output: 189 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-08 22:28:57,037 INFO L349 Elim1Store]: treesize reduction 6751, result has 6.0 percent of original size [2025-01-08 22:28:57,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 37 select indices, 37 select index equivalence classes, 0 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 703 case distinctions, treesize of input 785 treesize of output 892 [2025-01-08 22:29:12,492 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 2444 DAG size of output: 195 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-08 22:29:12,492 INFO L349 Elim1Store]: treesize reduction 7181, result has 5.9 percent of original size [2025-01-08 22:29:12,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 38 select indices, 38 select index equivalence classes, 0 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 741 case distinctions, treesize of input 810 treesize of output 920