./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/forester-heap/dll-reverse.i -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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:07:16,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:07:17,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:07:17,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:07:17,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:07:17,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:07:17,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:07:17,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:07:17,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:07:17,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:07:17,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:07:17,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:07:17,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:07:17,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:07:17,021 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:07:17,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:07:17,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:07:17,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:17,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:07:17,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:07:17,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:07:17,024 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2025-02-07 20:07:17,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:07:17,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:07:17,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:07:17,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:07:17,288 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:07:17,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2025-02-07 20:07:18,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f38ecbf/21ac770f7a0f401bbc413dd1df67200e/FLAG3e753c4ed [2025-02-07 20:07:18,778 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:07:18,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2025-02-07 20:07:18,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f38ecbf/21ac770f7a0f401bbc413dd1df67200e/FLAG3e753c4ed [2025-02-07 20:07:18,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f38ecbf/21ac770f7a0f401bbc413dd1df67200e [2025-02-07 20:07:18,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:07:18,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:07:18,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:18,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:07:18,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:07:18,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:18" (1/1) ... [2025-02-07 20:07:18,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:18, skipping insertion in model container [2025-02-07 20:07:18,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:18" (1/1) ... [2025-02-07 20:07:18,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:07:19,050 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/forester-heap/dll-reverse.i[22309,22322] [2025-02-07 20:07:19,054 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/forester-heap/dll-reverse.i[22394,22407] [2025-02-07 20:07:19,058 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/forester-heap/dll-reverse.i[22924,22937] [2025-02-07 20:07:19,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:19,076 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:07:19,101 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/forester-heap/dll-reverse.i[22309,22322] [2025-02-07 20:07:19,101 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/forester-heap/dll-reverse.i[22394,22407] [2025-02-07 20:07:19,104 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/forester-heap/dll-reverse.i[22924,22937] [2025-02-07 20:07:19,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:19,123 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:07:19,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19 WrapperNode [2025-02-07 20:07:19,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:19,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:19,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:07:19,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:07:19,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,148 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2025-02-07 20:07:19,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:19,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:07:19,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:07:19,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:07:19,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,176 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-02-07 20:07:19,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:07:19,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:07:19,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:07:19,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:07:19,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (1/1) ... [2025-02-07 20:07:19,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:19,208 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-02-07 20:07:19,212 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-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:07:19,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:07:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:07:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:07:19,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:07:19,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:07:19,299 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:07:19,300 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:07:19,486 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-07 20:07:19,486 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:07:19,497 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:07:19,497 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:07:19,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:19 BoogieIcfgContainer [2025-02-07 20:07:19,497 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:07:19,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:07:19,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:07:19,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:07:19,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:07:18" (1/3) ... [2025-02-07 20:07:19,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240349e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:19, skipping insertion in model container [2025-02-07 20:07:19,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:19" (2/3) ... [2025-02-07 20:07:19,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240349e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:19, skipping insertion in model container [2025-02-07 20:07:19,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:19" (3/3) ... [2025-02-07 20:07:19,505 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2025-02-07 20:07:19,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:07:19,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-reverse.i that has 1 procedures, 35 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2025-02-07 20:07:19,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:07:19,578 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;@4a8104d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:07:19,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-07 20:07:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 34 states have internal predecessors, (54), 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-02-07 20:07:19,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:07:19,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:19,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:19,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash -309447842, now seen corresponding path program 1 times [2025-02-07 20:07:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984470733] [2025-02-07 20:07:19,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:19,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:07:19,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:07:19,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:19,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:19,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984470733] [2025-02-07 20:07:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984470733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:19,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:07:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872907837] [2025-02-07 20:07:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:19,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:07:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:19,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:07:19,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:07:19,748 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 34 states have internal predecessors, (54), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-07 20:07:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:19,759 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2025-02-07 20:07:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:07:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-07 20:07:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:19,766 INFO L225 Difference]: With dead ends: 67 [2025-02-07 20:07:19,766 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:07:19,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:07:19,769 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:19,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:07:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-07 20:07:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 31 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-02-07 20:07:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-07 20:07:19,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 7 [2025-02-07 20:07:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:19,794 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-07 20:07:19,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-07 20:07:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-07 20:07:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:07:19,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:19,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:19,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:07:19,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:19,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1983643433, now seen corresponding path program 1 times [2025-02-07 20:07:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:19,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690493210] [2025-02-07 20:07:19,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:19,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:07:19,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:07:19,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:19,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:20,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:20,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690493210] [2025-02-07 20:07:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690493210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:07:20,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839612250] [2025-02-07 20:07:20,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:20,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:20,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:20,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:20,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:20,072 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-02-07 20:07:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:20,187 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2025-02-07 20:07:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:07:20,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-02-07 20:07:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:20,189 INFO L225 Difference]: With dead ends: 74 [2025-02-07 20:07:20,189 INFO L226 Difference]: Without dead ends: 46 [2025-02-07 20:07:20,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:07:20,190 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:20,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 97 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-07 20:07:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2025-02-07 20:07:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 37 states have internal predecessors, (46), 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-02-07 20:07:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-02-07 20:07:20,194 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 10 [2025-02-07 20:07:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:20,194 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-07 20:07:20,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-02-07 20:07:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-02-07 20:07:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:07:20,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:20,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:20,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:07:20,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:20,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1982699058, now seen corresponding path program 1 times [2025-02-07 20:07:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:20,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446833232] [2025-02-07 20:07:20,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:20,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:20,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:07:20,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:07:20,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:20,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:20,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446833232] [2025-02-07 20:07:20,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446833232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:20,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:20,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670902545] [2025-02-07 20:07:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:20,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:20,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:20,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:20,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:20,237 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-02-07 20:07:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:20,292 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-02-07 20:07:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-02-07 20:07:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:20,293 INFO L225 Difference]: With dead ends: 66 [2025-02-07 20:07:20,293 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 20:07:20,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:20,293 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:20,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 20:07:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2025-02-07 20:07:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 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-02-07 20:07:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-02-07 20:07:20,298 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 10 [2025-02-07 20:07:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:20,298 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-02-07 20:07:20,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-02-07 20:07:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-02-07 20:07:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:07:20,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:20,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:20,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:07:20,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:20,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash 553800902, now seen corresponding path program 1 times [2025-02-07 20:07:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690612780] [2025-02-07 20:07:20,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:20,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:07:20,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:07:20,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:20,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:07:20,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:20,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690612780] [2025-02-07 20:07:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690612780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87861491] [2025-02-07 20:07:20,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:20,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:20,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:20,468 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-02-07 20:07:20,471 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-02-07 20:07:20,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:07:20,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:07:20,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:20,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:20,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 20:07:20,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:20,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 17 [2025-02-07 20:07:20,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-02-07 20:07:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:07:20,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:07:20,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87861491] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:20,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:20,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-07 20:07:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62920185] [2025-02-07 20:07:20,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:20,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:07:20,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:20,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:07:20,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:20,796 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-07 20:07:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:20,912 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-02-07 20:07:20,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:07:20,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-07 20:07:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:20,913 INFO L225 Difference]: With dead ends: 55 [2025-02-07 20:07:20,914 INFO L226 Difference]: Without dead ends: 51 [2025-02-07 20:07:20,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:07:20,914 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:20,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 53 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-07 20:07:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2025-02-07 20:07:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 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-02-07 20:07:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-02-07 20:07:20,918 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 19 [2025-02-07 20:07:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:20,918 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-02-07 20:07:20,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-02-07 20:07:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-02-07 20:07:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:07:20,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:20,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:20,926 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-02-07 20:07:21,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:21,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1390039261, now seen corresponding path program 1 times [2025-02-07 20:07:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-02-07 20:07:21,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:21,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:21,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:21,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:21,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:07:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-02-07 20:07:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034034789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:21,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134580648] [2025-02-07 20:07:21,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:21,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:07:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:21,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:07:21,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:07:21,168 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-07 20:07:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:21,180 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-02-07 20:07:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:07:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-02-07 20:07:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:21,180 INFO L225 Difference]: With dead ends: 43 [2025-02-07 20:07:21,180 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 20:07:21,181 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-02-07 20:07:21,181 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:21,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 20:07:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-02-07 20:07:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 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-02-07 20:07:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-02-07 20:07:21,184 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2025-02-07 20:07:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:21,185 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-02-07 20:07:21,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-07 20:07:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-02-07 20:07:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:07:21,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:21,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:21,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:07:21,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1390069052, now seen corresponding path program 1 times [2025-02-07 20:07:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334055403] [2025-02-07 20:07:21,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:21,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:21,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:21,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:21,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334055403] [2025-02-07 20:07:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334055403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479692753] [2025-02-07 20:07:21,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:21,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:21,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:21,442 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-02-07 20:07:21,444 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-02-07 20:07:21,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:21,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:21,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:21,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:21,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-07 20:07:21,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:21,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-07 20:07:21,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2025-02-07 20:07:21,700 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2025-02-07 20:07:21,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 119 [2025-02-07 20:07:21,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 67 treesize of output 47 [2025-02-07 20:07:21,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2025-02-07 20:07:21,723 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-02-07 20:07:21,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 105 [2025-02-07 20:07:21,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 55 treesize of output 45 [2025-02-07 20:07:21,747 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-07 20:07:21,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-07 20:07:21,763 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-07 20:07:21,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 5 [2025-02-07 20:07:21,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2025-02-07 20:07:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:21,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:21,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:21,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2025-02-07 20:07:21,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:21,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 190 treesize of output 133 [2025-02-07 20:07:21,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:21,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 76 treesize of output 75 [2025-02-07 20:07:21,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 66 treesize of output 62 [2025-02-07 20:07:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479692753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:22,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:22,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-07 20:07:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658196898] [2025-02-07 20:07:22,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:22,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:07:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:22,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:07:22,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:07:22,202 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 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-02-07 20:07:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:22,483 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2025-02-07 20:07:22,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:07:22,484 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 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 20 [2025-02-07 20:07:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:22,484 INFO L225 Difference]: With dead ends: 84 [2025-02-07 20:07:22,484 INFO L226 Difference]: Without dead ends: 72 [2025-02-07 20:07:22,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:07:22,485 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 165 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:22,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 178 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:07:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-07 20:07:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2025-02-07 20:07:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 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-02-07 20:07:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-02-07 20:07:22,490 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 20 [2025-02-07 20:07:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:22,490 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-02-07 20:07:22,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 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-02-07 20:07:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-02-07 20:07:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:07:22,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:22,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:22,498 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-02-07 20:07:22,691 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-02-07 20:07:22,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1097443781, now seen corresponding path program 1 times [2025-02-07 20:07:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252174117] [2025-02-07 20:07:22,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:22,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:22,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:22,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:22,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:07:22,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:22,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252174117] [2025-02-07 20:07:22,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252174117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:22,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:07:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040230450] [2025-02-07 20:07:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:22,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:22,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:22,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:22,815 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-07 20:07:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:22,895 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2025-02-07 20:07:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:22,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2025-02-07 20:07:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:22,896 INFO L225 Difference]: With dead ends: 81 [2025-02-07 20:07:22,896 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 20:07:22,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:22,897 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:22,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 20:07:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-02-07 20:07:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 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-02-07 20:07:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-02-07 20:07:22,909 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 20 [2025-02-07 20:07:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:22,909 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-02-07 20:07:22,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-07 20:07:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-02-07 20:07:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 20:07:22,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:22,910 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:22,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:07:22,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:22,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash 775573767, now seen corresponding path program 2 times [2025-02-07 20:07:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470919315] [2025-02-07 20:07:22,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:07:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:22,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-07 20:07:22,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:07:22,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:07:22,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:23,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470919315] [2025-02-07 20:07:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470919315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167614315] [2025-02-07 20:07:23,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:07:23,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:23,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:23,483 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-02-07 20:07:23,487 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-02-07 20:07:23,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-07 20:07:23,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:07:23,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:07:23,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:23,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-07 20:07:23,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:23,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-07 20:07:23,748 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 11 treesize of output 7 [2025-02-07 20:07:23,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:23,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2025-02-07 20:07:23,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2025-02-07 20:07:23,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-02-07 20:07:23,793 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-07 20:07:23,793 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-07 20:07:23,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 20:07:23,806 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:07:23,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:23,814 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-07 20:07:23,821 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-07 20:07:23,822 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2025-02-07 20:07:23,826 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:07:23,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:23,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-02-07 20:07:23,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2025-02-07 20:07:23,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-07 20:07:23,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2025-02-07 20:07:23,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-07 20:07:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:23,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:24,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2025-02-07 20:07:24,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_487) |c_ULTIMATE.start_main_~prev~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~prev~0#1.offset|)) 1)) is different from false [2025-02-07 20:07:24,017 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_482 (Array Int Int)) (v_ArrVal_487 (Array Int Int))) (or (not (= v_ArrVal_482 (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_482 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse0 (select v_ArrVal_482 .cse0))))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_482) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_487) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) 1))) is different from false [2025-02-07 20:07:24,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_482 (Array Int Int)) (v_ArrVal_487 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_482) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_487) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 1) (not (= v_ArrVal_482 (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_482 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse0 (select v_ArrVal_482 .cse0))))))) is different from false [2025-02-07 20:07:24,073 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-07 20:07:24,074 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 261 treesize of output 267 [2025-02-07 20:07:24,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:24,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 367 treesize of output 353 [2025-02-07 20:07:24,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 221 treesize of output 215 [2025-02-07 20:07:24,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 81 treesize of output 77 [2025-02-07 20:07:24,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:25,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 1318 treesize of output 1222 [2025-02-07 20:07:27,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:27,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:27,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:27,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:27,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:27,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:29,201 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-02-07 20:07:29,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:29,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-02-07 20:07:29,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:29,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:29,321 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-02-07 20:07:29,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-02-07 20:07:29,335 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,340 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,342 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-07 20:07:29,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-02-07 20:07:29,345 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2025-02-07 20:07:29,351 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-02-07 20:07:29,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:29,405 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2025-02-07 20:07:29,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-07 20:07:29,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:29,429 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-02-07 20:07:29,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:29,479 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-02-07 20:07:29,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:29,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:29,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:07:29,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 167 treesize of output 171 [2025-02-07 20:07:29,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2025-02-07 20:07:29,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:29,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:29,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:29,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:29,725 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-02-07 20:07:29,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-02-07 20:07:29,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 41 treesize of output 41 [2025-02-07 20:07:29,772 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2025-02-07 20:07:29,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:29,834 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-02-07 20:07:29,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-02-07 20:07:29,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,857 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-02-07 20:07:29,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-02-07 20:07:29,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 32 treesize of output 32 [2025-02-07 20:07:29,888 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:29,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2025-02-07 20:07:29,955 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-02-07 20:07:29,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-02-07 20:07:29,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:29,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:29,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 32 treesize of output 32 [2025-02-07 20:07:30,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,006 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2025-02-07 20:07:30,009 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-02-07 20:07:30,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:07:30,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 171 [2025-02-07 20:07:30,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2025-02-07 20:07:30,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:30,165 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-02-07 20:07:30,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-02-07 20:07:30,178 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2025-02-07 20:07:30,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 111 treesize of output 115 [2025-02-07 20:07:30,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:30,270 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-02-07 20:07:30,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-02-07 20:07:30,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 171 [2025-02-07 20:07:30,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 95 [2025-02-07 20:07:30,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,447 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-02-07 20:07:30,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-02-07 20:07:30,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:30,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2025-02-07 20:07:30,490 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2025-02-07 20:07:30,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:30,564 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-02-07 20:07:30,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-02-07 20:07:30,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 32 treesize of output 32 [2025-02-07 20:07:30,597 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2025-02-07 20:07:30,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-07 20:07:30,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-02-07 20:07:30,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 17 [2025-02-07 20:07:30,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,657 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,658 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-07 20:07:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:30,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:30,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,680 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,681 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-02-07 20:07:30,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 17 [2025-02-07 20:07:30,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-07 20:07:30,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:30,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:30,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,736 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,737 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:07:30,739 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,740 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:07:30,742 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2025-02-07 20:07:30,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-07 20:07:30,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-02-07 20:07:30,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 17 [2025-02-07 20:07:30,807 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2025-02-07 20:07:30,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-07 20:07:30,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-02-07 20:07:30,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 17 [2025-02-07 20:07:30,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,881 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,881 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-07 20:07:30,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:30,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:30,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,905 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,906 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-07 20:07:30,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:30,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:30,930 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:30,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2025-02-07 20:07:30,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:30,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:30,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-07 20:07:30,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:30,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-02-07 20:07:30,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:30,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:30,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 17 [2025-02-07 20:07:31,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2025-02-07 20:07:31,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:31,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:31,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-02-07 20:07:31,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-02-07 20:07:31,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:31,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-07 20:07:31,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 17 [2025-02-07 20:07:31,060 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,060 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-07 20:07:31,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:31,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:31,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:31,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:31,089 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,089 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-07 20:07:31,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:31,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:31,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:31,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:31,113 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,114 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:07:31,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 40 treesize of output 38 [2025-02-07 20:07:31,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-02-07 20:07:31,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:07:31,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:31,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:31,136 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-02-07 20:07:31,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:31,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:07:31,152 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2025-02-07 20:07:31,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:31,213 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-02-07 20:07:31,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-02-07 20:07:31,222 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,229 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,233 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-02-07 20:07:31,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-02-07 20:07:31,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 32 treesize of output 32 [2025-02-07 20:07:31,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:07:31,263 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 111 treesize of output 115 [2025-02-07 20:07:31,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:07:31,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 95 treesize of output 99 [2025-02-07 20:07:31,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:07:31,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:31,393 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-02-07 20:07:31,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-02-07 20:07:31,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 32 treesize of output 32 [2025-02-07 20:07:31,420 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2025-02-07 20:07:31,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:07:31,479 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-02-07 20:07:31,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-02-07 20:07:31,487 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,493 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:07:31,497 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-02-07 20:07:31,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-02-07 20:07:31,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:31,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 32 treesize of output 32 [2025-02-07 20:07:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-07 20:07:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167614315] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:36,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:36,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-02-07 20:07:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407292550] [2025-02-07 20:07:36,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:36,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 20:07:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:36,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 20:07:36,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=289, Unknown=8, NotChecked=108, Total=462 [2025-02-07 20:07:36,288 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 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-02-07 20:07:37,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:07:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:42,706 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2025-02-07 20:07:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:07:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 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 21 [2025-02-07 20:07:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:42,707 INFO L225 Difference]: With dead ends: 86 [2025-02-07 20:07:42,707 INFO L226 Difference]: Without dead ends: 84 [2025-02-07 20:07:42,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=80, Invalid=429, Unknown=9, NotChecked=132, Total=650 [2025-02-07 20:07:42,708 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 65 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:42,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 298 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 0 Unknown, 222 Unchecked, 2.2s Time] [2025-02-07 20:07:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-07 20:07:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2025-02-07 20:07:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 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-02-07 20:07:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2025-02-07 20:07:42,713 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 21 [2025-02-07 20:07:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:42,713 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-02-07 20:07:42,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 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-02-07 20:07:42,713 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2025-02-07 20:07:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:07:42,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:42,714 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:42,723 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-02-07 20:07:42,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:42,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:42,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:42,918 INFO L85 PathProgramCache]: Analyzing trace with hash -808975580, now seen corresponding path program 3 times [2025-02-07 20:07:42,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087772142] [2025-02-07 20:07:42,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:07:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:42,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-02-07 20:07:42,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:07:42,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:07:42,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087772142] [2025-02-07 20:07:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087772142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597779829] [2025-02-07 20:07:43,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:07:43,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:43,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:43,532 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-02-07 20:07:43,535 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-02-07 20:07:43,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-02-07 20:07:43,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:07:43,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 20:07:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:43,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-07 20:07:43,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:43,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-07 20:07:44,007 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 212 [2025-02-07 20:07:44,338 INFO L349 Elim1Store]: treesize reduction 530, result has 9.7 percent of original size [2025-02-07 20:07:44,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 541 treesize of output 595 [2025-02-07 20:07:44,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 425 treesize of output 288 [2025-02-07 20:07:44,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:44,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:44,482 INFO L349 Elim1Store]: treesize reduction 214, result has 17.7 percent of original size [2025-02-07 20:07:44,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 334 [2025-02-07 20:07:44,502 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2025-02-07 20:07:44,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 13 [2025-02-07 20:07:44,543 INFO L349 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2025-02-07 20:07:44,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 60 [2025-02-07 20:07:44,562 INFO L349 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2025-02-07 20:07:44,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 39 [2025-02-07 20:07:44,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2025-02-07 20:07:44,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2025-02-07 20:07:44,673 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-07 20:07:44,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:07:44,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 20:07:44,876 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-07 20:07:44,883 INFO L158 Benchmark]: Toolchain (without parser) took 26071.82ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 110.7MB in the beginning and 252.5MB in the end (delta: -141.7MB). Peak memory consumption was 138.5MB. Max. memory is 16.1GB. [2025-02-07 20:07:44,883 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:07:44,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.65ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 92.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:07:44,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.30ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:07:44,883 INFO L158 Benchmark]: Boogie Preprocessor took 35.32ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:07:44,883 INFO L158 Benchmark]: IcfgBuilder took 312.77ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 70.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:07:44,883 INFO L158 Benchmark]: TraceAbstraction took 25382.77ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 69.8MB in the beginning and 252.5MB in the end (delta: -182.6MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2025-02-07 20:07:44,884 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.65ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 92.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.30ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.32ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 312.77ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 70.3MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25382.77ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 69.8MB in the beginning and 252.5MB in the end (delta: -182.6MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-02-07 20:07:44,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/dll-reverse.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:07:46,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:07:46,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 20:07:46,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:07:46,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:07:47,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:07:47,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:07:47,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:07:47,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:07:47,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:07:47,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:07:47,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:07:47,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:07:47,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:07:47,023 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:07:47,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:07:47,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:07:47,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:07:47,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:47,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:07:47,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:07:47,025 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2025-02-07 20:07:47,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:07:47,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:07:47,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:07:47,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:07:47,240 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:07:47,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2025-02-07 20:07:48,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68d51b9f7/4e07f50e07534b1189844ffdac73459a/FLAGab884e2cf [2025-02-07 20:07:48,691 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:07:48,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2025-02-07 20:07:48,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68d51b9f7/4e07f50e07534b1189844ffdac73459a/FLAGab884e2cf [2025-02-07 20:07:48,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68d51b9f7/4e07f50e07534b1189844ffdac73459a [2025-02-07 20:07:48,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:07:48,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:07:48,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:48,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:07:48,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:07:48,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:48,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3d5e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48, skipping insertion in model container [2025-02-07 20:07:48,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:48,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:07:48,881 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/forester-heap/dll-reverse.i[22309,22322] [2025-02-07 20:07:48,884 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/forester-heap/dll-reverse.i[22394,22407] [2025-02-07 20:07:48,890 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/forester-heap/dll-reverse.i[22924,22937] [2025-02-07 20:07:48,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:48,906 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:07:48,931 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/forester-heap/dll-reverse.i[22309,22322] [2025-02-07 20:07:48,932 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/forester-heap/dll-reverse.i[22394,22407] [2025-02-07 20:07:48,936 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/forester-heap/dll-reverse.i[22924,22937] [2025-02-07 20:07:48,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:48,958 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:07:48,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48 WrapperNode [2025-02-07 20:07:48,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:48,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:48,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:07:48,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:07:48,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:48,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,003 INFO L138 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2025-02-07 20:07:49,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:49,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:07:49,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:07:49,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:07:49,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,030 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-02-07 20:07:49,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:07:49,055 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:07:49,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:07:49,055 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:07:49,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (1/1) ... [2025-02-07 20:07:49,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:49,094 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-02-07 20:07:49,105 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-02-07 20:07:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-07 20:07:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-07 20:07:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 20:07:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:07:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:07:49,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:07:49,235 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:07:49,846 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-07 20:07:49,847 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:07:49,856 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:07:49,856 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:07:49,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:49 BoogieIcfgContainer [2025-02-07 20:07:49,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:07:49,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:07:49,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:07:49,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:07:49,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:07:48" (1/3) ... [2025-02-07 20:07:49,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad4d13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:49, skipping insertion in model container [2025-02-07 20:07:49,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:48" (2/3) ... [2025-02-07 20:07:49,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad4d13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:49, skipping insertion in model container [2025-02-07 20:07:49,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:49" (3/3) ... [2025-02-07 20:07:49,866 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2025-02-07 20:07:49,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:07:49,876 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-reverse.i that has 1 procedures, 35 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2025-02-07 20:07:49,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:07:49,921 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10d2fdf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:07:49,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-07 20:07:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 34 states have internal predecessors, (54), 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-02-07 20:07:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:07:49,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:49,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:49,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:49,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -309447842, now seen corresponding path program 1 times [2025-02-07 20:07:49,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:07:49,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106620406] [2025-02-07 20:07:49,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:49,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:49,945 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-02-07 20:07:49,949 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-02-07 20:07:50,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:07:50,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:07:50,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:50,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:50,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 20:07:50,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:50,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:07:50,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:07:50,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106620406] [2025-02-07 20:07:50,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106620406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:50,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:50,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:07:50,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099700749] [2025-02-07 20:07:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:50,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:07:50,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:07:50,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:07:50,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:07:50,098 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 34 states have internal predecessors, (54), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-07 20:07:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:50,106 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2025-02-07 20:07:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:07:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-07 20:07:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:50,111 INFO L225 Difference]: With dead ends: 67 [2025-02-07 20:07:50,111 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:07:50,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:07:50,114 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:50,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:07:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-07 20:07:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 31 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-02-07 20:07:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-07 20:07:50,133 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 7 [2025-02-07 20:07:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:50,133 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-07 20:07:50,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-07 20:07:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-07 20:07:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:07:50,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:50,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:50,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:07:50,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:50,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1983643433, now seen corresponding path program 1 times [2025-02-07 20:07:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:07:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418406165] [2025-02-07 20:07:50,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:50,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:50,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:50,342 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-02-07 20:07:50,343 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-02-07 20:07:50,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:07:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:07:50,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:50,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:50,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:07:50,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:50,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:07:50,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:07:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418406165] [2025-02-07 20:07:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418406165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:50,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265591088] [2025-02-07 20:07:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:50,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:07:50,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:50,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:50,462 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-02-07 20:07:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:50,689 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2025-02-07 20:07:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:50,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-02-07 20:07:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:50,691 INFO L225 Difference]: With dead ends: 59 [2025-02-07 20:07:50,691 INFO L226 Difference]: Without dead ends: 45 [2025-02-07 20:07:50,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:50,691 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:50,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:07:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-07 20:07:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-02-07 20:07:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 39 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-02-07 20:07:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-02-07 20:07:50,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 10 [2025-02-07 20:07:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:50,700 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-02-07 20:07:50,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-02-07 20:07:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-02-07 20:07:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:07:50,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:50,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:50,706 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-02-07 20:07:50,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:50,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:50,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:50,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1604489849, now seen corresponding path program 1 times [2025-02-07 20:07:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:07:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742489860] [2025-02-07 20:07:50,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:50,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:50,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:50,911 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-02-07 20:07:50,912 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-02-07 20:07:50,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:07:50,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:07:50,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:50,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:50,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 20:07:50,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:51,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 17 [2025-02-07 20:07:51,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-02-07 20:07:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:51,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:51,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:07:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742489860] [2025-02-07 20:07:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742489860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:51,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:07:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2025-02-07 20:07:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830647420] [2025-02-07 20:07:51,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:51,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:07:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:07:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:07:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:51,217 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-02-07 20:07:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:53,083 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-02-07 20:07:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:07:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 17 [2025-02-07 20:07:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:53,084 INFO L225 Difference]: With dead ends: 50 [2025-02-07 20:07:53,084 INFO L226 Difference]: Without dead ends: 46 [2025-02-07 20:07:53,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:07:53,084 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:53,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-07 20:07:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-07 20:07:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2025-02-07 20:07:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-02-07 20:07:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-07 20:07:53,088 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2025-02-07 20:07:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:53,088 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-07 20:07:53,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-02-07 20:07:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-07 20:07:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:07:53,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:53,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:53,096 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-02-07 20:07:53,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:53,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:53,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1397376226, now seen corresponding path program 1 times [2025-02-07 20:07:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:07:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695566669] [2025-02-07 20:07:53,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:53,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:53,297 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-02-07 20:07:53,298 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-02-07 20:07:53,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:53,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:53,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:53,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:53,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 20:07:53,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:07:53,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:07:53,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:07:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695566669] [2025-02-07 20:07:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695566669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:53,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038174972] [2025-02-07 20:07:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:53,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:07:53,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:07:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:07:53,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:07:53,402 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-07 20:07:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:53,428 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2025-02-07 20:07:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:07:53,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-02-07 20:07:53,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:53,429 INFO L225 Difference]: With dead ends: 37 [2025-02-07 20:07:53,429 INFO L226 Difference]: Without dead ends: 35 [2025-02-07 20:07:53,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-02-07 20:07:53,430 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:53,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:53,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-07 20:07:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2025-02-07 20:07:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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-02-07 20:07:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-07 20:07:53,437 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2025-02-07 20:07:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:53,437 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-07 20:07:53,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-02-07 20:07:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-07 20:07:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:07:53,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:53,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:53,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:07:53,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:53,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:53,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1397346435, now seen corresponding path program 1 times [2025-02-07 20:07:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:07:53,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [279972317] [2025-02-07 20:07:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:53,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:53,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:07:53,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:07:53,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:53,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:53,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:53,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:53,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 20:07:53,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:53,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 17 [2025-02-07 20:07:53,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-07 20:07:53,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-02-07 20:07:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:07:53,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:07:53,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:07:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279972317] [2025-02-07 20:07:53,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279972317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:53,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:07:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787845238] [2025-02-07 20:07:53,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:53,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:07:53,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:53,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:53,892 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-07 20:07:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:54,803 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-02-07 20:07:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2025-02-07 20:07:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:54,803 INFO L225 Difference]: With dead ends: 52 [2025-02-07 20:07:54,803 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 20:07:54,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:54,804 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:54,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 78 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 20:07:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 20:07:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-07 20:07:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 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-02-07 20:07:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-02-07 20:07:54,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2025-02-07 20:07:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:54,812 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-02-07 20:07:54,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-02-07 20:07:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-02-07 20:07:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:07:54,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:54,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:54,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:07:55,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:55,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:55,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -410108028, now seen corresponding path program 1 times [2025-02-07 20:07:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:07:55,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775923806] [2025-02-07 20:07:55,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:55,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:55,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:55,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:07:55,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:07:55,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:55,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:55,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:55,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:55,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 20:07:55,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:55,112 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 27 treesize of output 17 [2025-02-07 20:07:55,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2025-02-07 20:07:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:07:55,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:07:55,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:07:55,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775923806] [2025-02-07 20:07:55,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775923806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:55,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:07:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565732952] [2025-02-07 20:07:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:55,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:07:55,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:55,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:55,275 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-02-07 20:07:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:56,480 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2025-02-07 20:07:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-02-07 20:07:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:56,481 INFO L225 Difference]: With dead ends: 89 [2025-02-07 20:07:56,481 INFO L226 Difference]: Without dead ends: 69 [2025-02-07 20:07:56,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:07:56,482 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:56,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 98 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 20:07:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-07 20:07:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2025-02-07 20:07:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 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-02-07 20:07:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-02-07 20:07:56,488 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 20 [2025-02-07 20:07:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:56,488 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-02-07 20:07:56,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-02-07 20:07:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-02-07 20:07:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:07:56,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:56,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:56,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 20:07:56,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:56,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:07:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1390069052, now seen corresponding path program 1 times [2025-02-07 20:07:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:07:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494933242] [2025-02-07 20:07:56,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:56,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:56,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:56,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:07:56,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:07:56,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 20:07:56,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:07:56,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:56,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:56,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:07:56,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:56,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:07:56,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2025-02-07 20:07:56,906 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2025-02-07 20:07:56,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 119 [2025-02-07 20:07:56,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 67 treesize of output 47 [2025-02-07 20:07:56,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2025-02-07 20:07:56,939 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-02-07 20:07:56,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 105 [2025-02-07 20:07:56,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 55 treesize of output 45 [2025-02-07 20:07:56,960 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-02-07 20:07:56,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-07 20:07:57,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:57,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 42 [2025-02-07 20:07:57,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:07:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:57,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:57,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:57,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2025-02-07 20:07:57,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:57,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 334 treesize of output 225 [2025-02-07 20:07:57,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:57,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 144 treesize of output 141 [2025-02-07 20:07:57,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 132 treesize of output 126 [2025-02-07 20:07:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:57,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:07:57,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494933242] [2025-02-07 20:07:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494933242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:57,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:07:57,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-07 20:07:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547719469] [2025-02-07 20:07:57,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:57,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:07:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:07:57,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:07:57,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:07:57,477 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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-02-07 20:08:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:04,247 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2025-02-07 20:08:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:08:04,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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 20 [2025-02-07 20:08:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:04,249 INFO L225 Difference]: With dead ends: 120 [2025-02-07 20:08:04,249 INFO L226 Difference]: Without dead ends: 108 [2025-02-07 20:08:04,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:08:04,250 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 168 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:04,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 179 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 11 Unknown, 0 Unchecked, 6.6s Time] [2025-02-07 20:08:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-07 20:08:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 59. [2025-02-07 20:08:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 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-02-07 20:08:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-02-07 20:08:04,263 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 20 [2025-02-07 20:08:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:04,265 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-02-07 20:08:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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-02-07 20:08:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-02-07 20:08:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 20:08:04,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:04,265 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:04,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:04,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:04,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:08:04,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash 775573767, now seen corresponding path program 2 times [2025-02-07 20:08:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:04,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663588658] [2025-02-07 20:08:04,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:08:04,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:04,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:04,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:04,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 20:08:04,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-07 20:08:05,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:08:05,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:08:05,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:05,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 20:08:05,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:05,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:08:05,315 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 11 treesize of output 7 [2025-02-07 20:08:05,355 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:08:05,365 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 70 [2025-02-07 20:08:05,395 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-02-07 20:08:05,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 153 [2025-02-07 20:08:05,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2025-02-07 20:08:05,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 101 treesize of output 87 [2025-02-07 20:08:05,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:05,461 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2025-02-07 20:08:05,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 78 [2025-02-07 20:08:05,481 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-02-07 20:08:05,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 17 treesize of output 17 [2025-02-07 20:08:05,499 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-07 20:08:05,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 5 [2025-02-07 20:08:05,507 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-07 20:08:05,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 5 [2025-02-07 20:08:05,515 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 96 [2025-02-07 20:08:05,527 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2025-02-07 20:08:05,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 199 [2025-02-07 20:08:05,534 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:08:05,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2025-02-07 20:08:05,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-02-07 20:08:05,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-07 20:08:05,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2025-02-07 20:08:05,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2025-02-07 20:08:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:05,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:05,830 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_349) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_351) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 32)) (not (= (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse0 (select v_ArrVal_349 .cse0))) v_ArrVal_349)))) is different from false [2025-02-07 20:08:05,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (not (= v_ArrVal_349 (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse0 (select v_ArrVal_349 .cse0))))))) is different from false [2025-02-07 20:08:05,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:05,893 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 103 [2025-02-07 20:08:06,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:06,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 1071 treesize of output 814 [2025-02-07 20:08:06,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:06,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 756 treesize of output 730 [2025-02-07 20:08:06,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 647 treesize of output 631 [2025-02-07 20:08:13,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:13,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:14,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:14,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:15,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:16,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:17,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-02-07 20:08:23,807 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)))) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse13 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (.cse46 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse179 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= (_ bv1 32) (select (select (store (store (store .cse179 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse179 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store v_ArrVal_348 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (.cse73 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse178 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse178 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store .cse178 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) (.cse12 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)))) (.cse43 (or .cse8 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse177 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (let ((.cse176 (store .cse177 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse176 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse176 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (not (= v_ArrVal_349 (store (store (select .cse177 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))))) (.cse56 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse175 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (= (_ bv1 32) (select (select (store (store .cse175 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse175 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (.cse45 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse174 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= (_ bv1 32) (select (select (store (store (store .cse174 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse174 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store (store (store (store .cse174 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse20 (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse173 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= (_ bv1 32) (select (select (store (store (store .cse173 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse173 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse52 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse172 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (let ((.cse171 (store .cse172 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse171 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse172 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store .cse171 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))) (.cse44 (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse168 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (not (= v_ArrVal_349 (store (store (select .cse168 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse169 (store .cse168 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse169 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store .cse169 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse170 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (_ bv1 32) (select (select (store (store .cse170 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (not (= v_ArrVal_349 (store (store (select .cse170 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))))) (.cse47 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse167 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse166 (store .cse167 v_arrayElimCell_34 v_ArrVal_348)) (.cse165 (store (store (store .cse167 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse165 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse166 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse166 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse165 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse48 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse164 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse164 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store (store .cse164 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse164 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))))) (.cse34 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse163 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse162 (store (store .cse163 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse162 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse163 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store .cse162 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))))) (.cse49 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse161 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse161 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store .cse161 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store (store .cse161 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))))))) (.cse37 (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse160 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse159 (store (store .cse160 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse159 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse160 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse159 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse51 (or .cse8 (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse154 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (let ((.cse153 (store .cse154 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse153 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse153 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (not (= v_ArrVal_349 (store (store (select .cse154 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse155 (store .cse156 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (_ bv1 32) (select (select (store .cse155 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse155 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (not (= v_ArrVal_349 (store (store (select .cse156 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse157 (store .cse158 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse157 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse157 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store .cse157 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (not (= v_ArrVal_349 (store (store (select .cse158 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))))) (.cse53 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse151 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse152 (store (store (store .cse151 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (not (= v_ArrVal_349 (store (store (select .cse151 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse152 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse152 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse54 (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse150 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (let ((.cse149 (store .cse150 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse149 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse149 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (not (= v_ArrVal_349 (store (store (select .cse150 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store .cse149 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) .cse8)) (.cse55 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse147 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse147 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse148 (store (store (store .cse147 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse148 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse148 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse50 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse146 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (= (_ bv1 32) (select (select (store (store .cse146 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (not (= v_ArrVal_349 (store (store (select .cse146 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (.cse57 (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse145 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (let ((.cse144 (store .cse145 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse144 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse144 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse145 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) .cse8)) (.cse58 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse142 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse143 (store (store (store .cse142 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (not (= v_ArrVal_349 (store (store (select .cse142 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse143 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse143 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store .cse143 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse59 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse141 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse141 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store (store .cse141 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36)))) (.cse75 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse140 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)) v_arrayElimCell_34 v_ArrVal_348))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse139 (store .cse140 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse139 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse139 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse139 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (not (= v_ArrVal_349 (store (store (select .cse140 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))))) (.cse60 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse138 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse137 (store .cse138 v_arrayElimCell_34 v_ArrVal_348))) (let ((.cse136 (store .cse137 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse136 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse137 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse136 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store (store .cse138 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse61 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse134 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse135 (store (store (store .cse134 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store (store (store .cse134 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse134 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store .cse135 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store .cse135 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34)))))) (.cse5 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse2 (store (store (store .cse0 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store .cse2 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store .cse2 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) .cse5) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) .cse7 .cse8) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (not (= v_ArrVal_349 (store (store (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (not (= v_ArrVal_349 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) .cse7 .cse8) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store .cse10 v_arrayElimCell_34 v_ArrVal_342))) (or (= (_ bv1 32) (select (select (store (store .cse11 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_36 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store .cse11 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (= (_ bv1 32) (select (select (store (store (store .cse10 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (or .cse12 .cse7 .cse13) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store .cse15 v_arrayElimCell_34 v_ArrVal_342))) (or (= (_ bv1 32) (select (select (store (store .cse16 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_36 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store .cse16 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (or (and (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse18 (store (store (store .cse17 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (not (= v_ArrVal_349 (store (store (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse18 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store .cse18 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store .cse19 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse19 v_arrayElimCell_34 v_ArrVal_342) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) .cse20 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse21 (store .cse23 v_arrayElimCell_34 v_ArrVal_348)) (.cse22 (store .cse23 v_arrayElimCell_34 v_ArrVal_342))) (or (not (= v_ArrVal_349 (store (store (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse21 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse22 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse22 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse26 (store .cse25 v_arrayElimCell_35 v_ArrVal_348))) (let ((.cse24 (store .cse26 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (select (select (store .cse24 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store .cse24 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse25 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))))) .cse8) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348))) (or (= (select (select (store (store .cse27 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_35) (not (= v_ArrVal_349 (store (store (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) .cse8) (or .cse8 (and (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))) (not (= v_ArrVal_349 (store (store (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (select (select (store .cse29 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store .cse29 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (not (= v_ArrVal_349 (store (store (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse32 (store .cse31 v_arrayElimCell_34 v_ArrVal_342))) (let ((.cse33 (store (store .cse32 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (not (= v_ArrVal_349 (store (store (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse32 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store .cse33 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store .cse33 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) .cse34 (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse35 (store .cse36 v_arrayElimCell_35 v_ArrVal_348))) (or (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse36 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) .cse8) .cse37 (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse38 (store .cse39 v_arrayElimCell_35 v_ArrVal_348))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_35) (not (= v_ArrVal_349 (store (store (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) .cse8) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse41 (store .cse40 v_arrayElimCell_34 v_ArrVal_342))) (or (= (_ bv1 32) (select (select (store (store (store .cse40 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse40 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse41 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse41 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_35) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store (store .cse42 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))))) (or (and .cse43 (or .cse44 .cse8) .cse45 (or .cse12 .cse46) .cse47 .cse48 .cse49 (or .cse50 .cse8) .cse51 (or .cse52 .cse8) .cse53 .cse54 .cse55 (or .cse56 .cse8) .cse57 .cse58 .cse59 .cse60 .cse61) .cse5) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (forall ((v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store .cse63 v_arrayElimCell_34 v_ArrVal_342))) (or (= (_ bv1 32) (select (select (store (store .cse62 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse62 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (not (= v_ArrVal_349 (store (store (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348))) (let ((.cse64 (store .cse65 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (select (select (store .cse64 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store .cse64 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (not (= v_ArrVal_349 (store (store (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) .cse8) (or .cse12 .cse13) (or (and (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse68 (store .cse67 v_arrayElimCell_35 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store .cse68 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (select (select (store .cse66 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse67 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store .cse66 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (not (= v_ArrVal_349 (store (store (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse69 (store .cse70 v_arrayElimCell_35 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select (store (store .cse69 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse70 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (not (= v_ArrVal_349 (store (store (select .cse69 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse71 (store .cse72 v_arrayElimCell_35 v_ArrVal_348))) (or (= (select (select (store (store .cse71 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse72 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse71 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_35)))) .cse8) (or .cse73 .cse12) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse74 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store .cse74 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store (store .cse74 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) .cse75 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse76 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= (_ bv1 32) (select (select (store (store (store .cse76 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse76 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store (store .cse76 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse79 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse78 (store .cse79 v_arrayElimCell_34 v_ArrVal_348))) (let ((.cse77 (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse77 v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse78 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse77 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse79 v_arrayElimCell_34 v_ArrVal_342) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_33 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse80 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348))) (or (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_33 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) .cse8)) .cse7) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse81 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store (store (store (store .cse81 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store (store .cse81 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (forall ((v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store .cse82 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_36 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (not (= v_ArrVal_349 (store (store (select (store .cse82 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (= (select (select (store (store .cse83 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse83 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) .cse5)) .cse8) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) .cse8) (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store .cse84 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse85 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse85 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (= (_ bv1 32) (select (select (store (store (store .cse85 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (_ bv1 32) (select (select (store (store (store .cse85 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse86 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse87 (store .cse86 v_arrayElimCell_34 v_ArrVal_348))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (forall ((v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse86 v_arrayElimCell_34 v_ArrVal_342) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_36 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (_ bv1 32) (select (select (store (store (store .cse86 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (= (_ bv1 32) (select (select (store (store .cse87 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (not (= v_ArrVal_349 (store (store (select .cse87 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (or .cse12 (let ((.cse90 (not .cse7))) (and (or (and (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_35) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse88 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse88 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse89 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store .cse89 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (_ bv1 32) (select (select (store (store .cse89 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))))) .cse90) (or (and (or .cse46 .cse7) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse92 (store (store .cse91 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse91 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse92 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse92 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) .cse90) (or .cse90 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse93 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse93 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store .cse93 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store .cse93 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) (or .cse90 (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse94 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse94 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store .cse94 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse95 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (store (store .cse95 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (_ bv1 32) (select (select (store .cse96 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store .cse96 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))))))) (or .cse90 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse97 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store (store .cse97 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36)))))) .cse5) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse98 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse99 (store .cse98 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse98 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse99 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store .cse99 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) .cse90) (or .cse90 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse100 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse100 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_35) (= (_ bv1 32) (select (select (store (store .cse100 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))) (or .cse73 .cse7) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse101 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select (store (store .cse101 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_342) v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse101 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store .cse101 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) .cse90)))) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse102 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse102 v_arrayElimCell_34 v_ArrVal_342) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_36 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (_ bv1 32) (select (select (store (store (store .cse102 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))))) (or .cse73 .cse12 .cse7) (or (and .cse43 (or .cse56 .cse7 .cse8) .cse45 .cse20 (or .cse52 .cse7 .cse8) (or .cse44 .cse7 .cse8) .cse47 .cse48 .cse34 .cse49 .cse37 .cse51 .cse53 .cse54 .cse55 (or .cse50 .cse7 .cse8) .cse57 .cse58 .cse59 .cse75 .cse60 .cse61) .cse5) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse103 (store .cse104 v_arrayElimCell_34 v_ArrVal_348))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse103 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse103 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (_ bv1 32) (select (select (store (store (store .cse104 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store (store .cse104 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) .cse5) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse106 (store .cse107 v_arrayElimCell_34 v_ArrVal_348))) (let ((.cse105 (store .cse106 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse105 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (not (= v_ArrVal_349 (store (store (select .cse106 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store .cse105 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store (store .cse107 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse108 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (= (_ bv1 32) (select (select (store (store (store .cse108 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store (store .cse108 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse109 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (_ bv1 32) (select (select (store (store (store .cse109 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store (store .cse109 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) .cse5) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (forall ((v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse111 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse110 (store .cse111 v_arrayElimCell_34 v_ArrVal_348))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store .cse110 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse111 v_arrayElimCell_34 v_ArrVal_342) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select (store (store .cse111 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))) (not (= v_ArrVal_349 (store (store (select .cse110 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse112 (store .cse113 v_arrayElimCell_34 v_ArrVal_348))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse112 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse112 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store (store .cse113 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store (store (store (store .cse113 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) .cse5) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse114 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store (store .cse114 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store (store (store (store .cse114 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) .cse5) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (let ((.cse116 (store (store (store .cse115 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse115 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (_ bv1 32) (select (select (store (store (store .cse115 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store .cse116 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (select (select (store .cse116 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) .cse5) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse117 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (not (= v_ArrVal_349 (store (store (select .cse117 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store .cse117 v_arrayElimCell_34 v_ArrVal_342) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select (store (store .cse117 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))))) (or (and (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse118 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (_ bv1 32) (select (select (store (store .cse118 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))) (not (= v_ArrVal_349 (store (store (select (store .cse118 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse120 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse119 (store .cse120 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (select (select (store .cse119 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store .cse119 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) (not (= v_ArrVal_349 (store (store (select .cse120 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse121 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (not (= v_ArrVal_349 (store (store (select .cse121 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select (store (store .cse121 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse122 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (= (select (select (store (store .cse122 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse122 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36)))) .cse5) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse123 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse124 (store .cse123 v_arrayElimCell_35 v_ArrVal_348))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store .cse123 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (= (select (select (store (store .cse124 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))) (not (= v_ArrVal_349 (store (store (select .cse124 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))))) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse125 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (or (= (_ bv1 32) (select (select (store (store .cse125 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (not (= v_ArrVal_349 (store (store (select (store .cse125 v_arrayElimCell_35 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_35)))) .cse8) (or (and (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse127 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (let ((.cse126 (store .cse127 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349))) (or (= (select (select (store .cse126 v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse127 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store .cse126 v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))) .cse5) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse128 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (let ((.cse129 (store .cse128 v_arrayElimCell_36 v_ArrVal_348))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store .cse128 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_36 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store .cse129 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))) (not (= v_ArrVal_349 (store (store (select .cse129 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))))) .cse8) (or (and (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse130 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348))) (or (= (select (select (store (store .cse130 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select .cse130 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) .cse5) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (forall ((v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse131 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342))) (or (= (select (select (store (store .cse131 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_36 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (not (= v_ArrVal_349 (store (store (select (store .cse131 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1))))))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))))) .cse8) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))) .cse7 .cse8) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse132 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse132 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (_ bv1 32) (select (select (store (store (store .cse132 v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store (store (store .cse132 v_arrayElimCell_34 v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_37 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32))))) (or .cse7 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_349 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_342) v_arrayElimCell_36 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))))) .cse8) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_347 (_ BitVec 32)) (v_ArrVal_348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_347)))) (or (= v_arrayElimCell_34 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_349 (store (store (select .cse133 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_349 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_349 .cse1)))) (= (select (select (store (store (store .cse133 v_arrayElimCell_34 v_ArrVal_348) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_35 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_34) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_34))) (= (select (select (store (store .cse133 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_349) v_arrayElimCell_34 v_ArrVal_351) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) (_ bv1 32)))))))) is different from true [2025-02-07 20:08:24,887 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:24,887 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:24,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-02-07 20:08:24,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:25,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:25,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 78 [2025-02-07 20:08:25,285 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:25,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:25,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:25,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:26,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:26,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:26,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:26,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 72 [2025-02-07 20:08:26,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:26,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:26,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:26,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:26,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:27,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:27,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:27,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:27,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 72 [2025-02-07 20:08:27,486 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:27,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:27,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:27,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:28,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:28,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:28,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:28,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:28,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-02-07 20:08:28,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-02-07 20:08:28,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 8 [2025-02-07 20:08:28,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2025-02-07 20:08:28,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:28,920 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:28,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:29,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:29,046 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,051 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,054 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,061 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,064 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,068 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,072 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,076 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,079 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,082 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,085 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,092 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-07 20:08:29,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:29,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 75 [2025-02-07 20:08:29,370 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:29,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:29,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:29,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:29,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:29,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:30,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:30,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:30,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 96 [2025-02-07 20:08:30,458 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:30,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:30,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:30,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:31,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:31,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:31,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:31,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:31,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 75 [2025-02-07 20:08:31,679 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:31,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:31,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:32,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:32,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:32,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:32,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-07 20:08:32,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:32,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 96 [2025-02-07 20:08:32,592 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:32,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:32,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:32,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:33,040 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:33,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-07 20:08:33,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:33,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:33,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 78 [2025-02-07 20:08:33,526 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:33,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:33,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:33,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:34,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:34,106 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:34,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-07 20:08:34,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:34,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 93 [2025-02-07 20:08:34,352 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:34,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:34,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:34,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:34,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:35,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:35,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:35,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:35,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 57 [2025-02-07 20:08:35,468 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:35,468 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:35,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:35,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2025-02-07 20:08:35,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:36,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:36,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:36,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:36,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 54 [2025-02-07 20:08:36,650 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:36,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:36,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2025-02-07 20:08:37,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:37,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:37,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:37,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:37,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 96 [2025-02-07 20:08:37,643 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:37,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:37,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:38,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:38,141 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:38,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-07 20:08:38,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:38,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:38,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 99 [2025-02-07 20:08:38,626 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:38,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:38,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:38,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:39,037 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:39,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-07 20:08:39,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:39,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:39,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 75 [2025-02-07 20:08:39,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:39,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:39,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:39,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:39,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:40,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:40,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:40,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:40,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 93 [2025-02-07 20:08:40,423 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:40,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:40,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:40,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:40,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:40,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:41,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:41,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:41,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 99 [2025-02-07 20:08:41,474 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:41,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:41,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:41,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:42,003 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:42,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-07 20:08:42,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:42,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:42,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 72 [2025-02-07 20:08:42,427 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:42,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:42,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 65 [2025-02-07 20:08:42,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:43,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:43,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:43,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:43,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:43,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 96 [2025-02-07 20:08:43,560 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:43,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:43,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2025-02-07 20:08:43,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2025-02-07 20:08:44,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:44,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20 treesize of output 20 [2025-02-07 20:08:44,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:44,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:44,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 78 [2025-02-07 20:08:44,621 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:44,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:44,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2025-02-07 20:08:44,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:45,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:45,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:45,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:45,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 99 [2025-02-07 20:08:45,606 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:45,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:45,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 104 [2025-02-07 20:08:45,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 34 treesize of output 22 [2025-02-07 20:08:46,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:46,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:46,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:46,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 102 [2025-02-07 20:08:46,566 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:46,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:46,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 104 [2025-02-07 20:08:46,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 34 treesize of output 22 [2025-02-07 20:08:46,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:47,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:47,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:47,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 81 [2025-02-07 20:08:47,578 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:47,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:47,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2025-02-07 20:08:47,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:48,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:48,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:48,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:48,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 78 [2025-02-07 20:08:48,521 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:48,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:48,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2025-02-07 20:08:48,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:48,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:49,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:49,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:49,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 78 [2025-02-07 20:08:49,492 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:49,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:49,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 81 [2025-02-07 20:08:49,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 23 treesize of output 15 [2025-02-07 20:08:50,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4 [2025-02-07 20:08:50,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 4