./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-properties/alternating_list-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-properties/alternating_list-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2539a605b5e381a0295e9071720016c9fcd416368cc6fb2029ad43f798de90 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:53:43,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:53:43,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:53:43,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:53:43,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:53:43,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:53:43,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:53:43,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:53:43,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:53:43,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:53:43,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:53:43,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:53:43,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:53:43,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:53:43,664 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:53:43,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:53:43,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:53:43,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:53:43,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:53:43,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:53:43,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:53:43,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:53:43,665 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:53:43,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:43,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:53:43,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:53:43,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:53:43,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:53:43,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:43,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:53:43,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:53:43,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:53:43,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:53:43,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:53:43,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:53:43,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:53:43,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:53:43,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:53:43,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2539a605b5e381a0295e9071720016c9fcd416368cc6fb2029ad43f798de90 [2025-04-29 10:53:43,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:53:43,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:53:43,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:53:43,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:53:43,895 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:53:43,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list-1.c [2025-04-29 10:53:45,214 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea204c4d/eb7bb4f7d0794a2dace53f96596e2fd8/FLAGfc76a0e1c [2025-04-29 10:53:45,397 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:53:45,398 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.c [2025-04-29 10:53:45,399 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:53:45,399 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:53:45,405 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea204c4d/eb7bb4f7d0794a2dace53f96596e2fd8/FLAGfc76a0e1c [2025-04-29 10:53:46,215 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea204c4d/eb7bb4f7d0794a2dace53f96596e2fd8 [2025-04-29 10:53:46,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:53:46,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:53:46,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:53:46,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:53:46,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:53:46,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f3e114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46, skipping insertion in model container [2025-04-29 10:53:46,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:53:46,376 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.c[1182,1195] [2025-04-29 10:53:46,382 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:53:46,390 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:53:46,417 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.c[1182,1195] [2025-04-29 10:53:46,420 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:53:46,435 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:53:46,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46 WrapperNode [2025-04-29 10:53:46,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:53:46,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:53:46,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:53:46,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:53:46,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,463 INFO L138 Inliner]: procedures = 13, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2025-04-29 10:53:46,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:53:46,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:53:46,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:53:46,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:53:46,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,488 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-04-29 10:53:46,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:53:46,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:53:46,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:53:46,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:53:46,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (1/1) ... [2025-04-29 10:53:46,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:46,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:53:46,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:53:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:53:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:53:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:53:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:53:46,557 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-29 10:53:46,557 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-29 10:53:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:53:46,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:53:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:53:46,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:53:46,610 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:53:46,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:53:46,636 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-29 10:53:46,721 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-04-29 10:53:46,721 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:53:46,727 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:53:46,729 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 10:53:46,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:53:46 BoogieIcfgContainer [2025-04-29 10:53:46,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:53:46,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:53:46,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:53:46,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:53:46,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:53:46" (1/3) ... [2025-04-29 10:53:46,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd64065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:53:46, skipping insertion in model container [2025-04-29 10:53:46,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:46" (2/3) ... [2025-04-29 10:53:46,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd64065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:53:46, skipping insertion in model container [2025-04-29 10:53:46,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:53:46" (3/3) ... [2025-04-29 10:53:46,736 INFO L128 eAbstractionObserver]: Analyzing ICFG alternating_list-1.c [2025-04-29 10:53:46,745 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:53:46,746 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG alternating_list-1.c that has 2 procedures, 32 locations, 46 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-29 10:53:46,782 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:53:46,791 INFO L340 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;@c6e621d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:53:46,792 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:53:46,795 INFO L278 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:46,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 10:53:46,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:46,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:46,800 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:46,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash 929956591, now seen corresponding path program 1 times [2025-04-29 10:53:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:46,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404540364] [2025-04-29 10:53:46,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:46,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 10:53:46,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 10:53:46,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:46,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:46,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404540364] [2025-04-29 10:53:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404540364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:53:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135341655] [2025-04-29 10:53:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:46,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:53:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:46,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:53:46,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:53:46,944 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:46,958 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-04-29 10:53:46,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:53:46,960 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 10:53:46,960 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:46,963 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:53:46,964 INFO L226 Difference]: Without dead ends: 19 [2025-04-29 10:53:46,965 INFO L436 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-04-29 10:53:46,967 INFO L437 NwaCegarLoop]: 38 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, 38 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-04-29 10:53:46,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:53:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-04-29 10:53:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-04-29 10:53:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-04-29 10:53:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-04-29 10:53:46,991 INFO L79 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2025-04-29 10:53:46,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:46,992 INFO L485 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-04-29 10:53:46,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:46,992 INFO L278 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-04-29 10:53:46,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 10:53:46,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:46,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:46,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:53:46,993 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:46,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash 941036052, now seen corresponding path program 1 times [2025-04-29 10:53:46,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:46,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314982931] [2025-04-29 10:53:46,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:47,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 10:53:47,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 10:53:47,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:47,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:47,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314982931] [2025-04-29 10:53:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314982931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:53:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113829813] [2025-04-29 10:53:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:47,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:53:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:47,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:53:47,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:53:47,065 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04-29 10:53:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:47,087 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-04-29 10:53:47,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:53:47,088 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-04-29 10:53:47,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:47,089 INFO L225 Difference]: With dead ends: 47 [2025-04-29 10:53:47,089 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 10:53:47,089 INFO L436 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-04-29 10:53:47,089 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:47,090 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:53:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 10:53:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-04-29 10:53:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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-04-29 10:53:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-04-29 10:53:47,093 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2025-04-29 10:53:47,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:47,093 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-04-29 10:53:47,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04-29 10:53:47,093 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-04-29 10:53:47,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 10:53:47,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:47,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:47,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:53:47,094 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:47,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash 941029108, now seen corresponding path program 1 times [2025-04-29 10:53:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:47,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121053143] [2025-04-29 10:53:47,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:47,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 10:53:47,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 10:53:47,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:47,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:47,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:47,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121053143] [2025-04-29 10:53:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121053143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:47,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:53:47,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473005427] [2025-04-29 10:53:47,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:47,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:53:47,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:47,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:53:47,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:53:47,260 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-04-29 10:53:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:47,329 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-04-29 10:53:47,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:53:47,330 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-04-29 10:53:47,330 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:47,330 INFO L225 Difference]: With dead ends: 57 [2025-04-29 10:53:47,330 INFO L226 Difference]: Without dead ends: 42 [2025-04-29 10:53:47,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04-29 10:53:47,339 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:47,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:53:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-29 10:53:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2025-04-29 10:53:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 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-04-29 10:53:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-04-29 10:53:47,343 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2025-04-29 10:53:47,343 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:47,343 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-04-29 10:53:47,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-04-29 10:53:47,343 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-04-29 10:53:47,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 10:53:47,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:47,344 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:47,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:53:47,344 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:47,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1361115555, now seen corresponding path program 1 times [2025-04-29 10:53:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:47,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922355844] [2025-04-29 10:53:47,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:47,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:53:47,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:53:47,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:47,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:47,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922355844] [2025-04-29 10:53:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922355844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:47,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139598983] [2025-04-29 10:53:47,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:47,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:47,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:47,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:53:47,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:53:47,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:53:47,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:47,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:47,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 10:53:47,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:47,818 INFO L354 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-04-29 10:53:47,875 INFO L354 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-04-29 10:53:47,907 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:53:47,908 INFO L354 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 11 treesize of output 11 [2025-04-29 10:53:47,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-29 10:53:48,007 INFO L354 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 16 treesize of output 11 [2025-04-29 10:53:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:48,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:48,094 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_73 (Array Int Int)) (v_ArrVal_74 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#0| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_73) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_74) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#0| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_73 .cse0))) v_ArrVal_73)))) is different from false [2025-04-29 10:53:48,176 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:48,176 INFO L354 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 132 treesize of output 134 [2025-04-29 10:53:48,196 INFO L354 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 24 treesize of output 20 [2025-04-29 10:53:48,229 INFO L354 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 5 treesize of output 3 [2025-04-29 10:53:48,236 INFO L354 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 102 treesize of output 98 [2025-04-29 10:53:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139598983] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:48,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:48,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-04-29 10:53:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379798393] [2025-04-29 10:53:48,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:48,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 10:53:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:48,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 10:53:48,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=302, Unknown=8, NotChecked=36, Total=420 [2025-04-29 10:53:48,325 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 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-04-29 10:53:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:48,758 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-04-29 10:53:48,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:53:48,759 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 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 18 [2025-04-29 10:53:48,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:48,759 INFO L225 Difference]: With dead ends: 46 [2025-04-29 10:53:48,759 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 10:53:48,760 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=654, Unknown=13, NotChecked=56, Total=930 [2025-04-29 10:53:48,760 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 97 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 30 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:48,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 95 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 145 Invalid, 22 Unknown, 36 Unchecked, 0.2s Time] [2025-04-29 10:53:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 10:53:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2025-04-29 10:53:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-04-29 10:53:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-04-29 10:53:48,765 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 18 [2025-04-29 10:53:48,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:48,765 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-04-29 10:53:48,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 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-04-29 10:53:48,765 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-04-29 10:53:48,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:53:48,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:48,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:48,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:53:48,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:48,966 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:48,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash -386224880, now seen corresponding path program 1 times [2025-04-29 10:53:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:48,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085932719] [2025-04-29 10:53:48,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:48,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:53:48,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:53:48,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:48,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:49,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085932719] [2025-04-29 10:53:49,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085932719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:49,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575564490] [2025-04-29 10:53:49,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:49,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:49,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:49,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:53:49,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 10:53:49,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:53:49,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:49,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:49,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-29 10:53:49,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:49,447 INFO L354 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-04-29 10:53:49,502 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:53:49,502 INFO L354 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 11 treesize of output 11 [2025-04-29 10:53:49,531 INFO L354 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 19 treesize of output 1 [2025-04-29 10:53:49,534 INFO L354 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 19 treesize of output 1 [2025-04-29 10:53:49,574 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 10:53:49,575 INFO L354 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 80 treesize of output 73 [2025-04-29 10:53:49,579 INFO L354 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 29 treesize of output 19 [2025-04-29 10:53:49,582 INFO L354 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 40 treesize of output 23 [2025-04-29 10:53:49,652 INFO L354 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 39 treesize of output 21 [2025-04-29 10:53:49,657 INFO L354 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 23 treesize of output 11 [2025-04-29 10:53:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:49,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:49,703 INFO L354 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 79 treesize of output 57 [2025-04-29 10:53:49,708 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_126 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_123 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_123) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2025-04-29 10:53:49,733 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:49,733 INFO L354 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 22 treesize of output 23 [2025-04-29 10:53:49,739 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:49,739 INFO L354 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 36 treesize of output 35 [2025-04-29 10:53:49,749 INFO L354 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-04-29 10:53:49,755 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-29 10:53:49,755 INFO L354 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 22 treesize of output 1 [2025-04-29 10:53:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 10:53:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575564490] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:49,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2025-04-29 10:53:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018834511] [2025-04-29 10:53:49,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:49,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 10:53:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:49,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 10:53:49,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2025-04-29 10:53:49,838 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 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-04-29 10:53:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:50,086 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-04-29 10:53:50,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:53:50,087 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 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 23 [2025-04-29 10:53:50,087 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:50,088 INFO L225 Difference]: With dead ends: 69 [2025-04-29 10:53:50,088 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 10:53:50,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=485, Unknown=1, NotChecked=46, Total=650 [2025-04-29 10:53:50,089 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 94 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:50,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 144 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2025-04-29 10:53:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 10:53:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-04-29 10:53:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 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-04-29 10:53:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-04-29 10:53:50,098 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2025-04-29 10:53:50,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:50,098 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-04-29 10:53:50,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 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-04-29 10:53:50,098 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-04-29 10:53:50,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 10:53:50,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:50,098 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:50,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 10:53:50,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:50,299 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:50,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1975521799, now seen corresponding path program 2 times [2025-04-29 10:53:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:50,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312603684] [2025-04-29 10:53:50,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:53:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:50,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-29 10:53:50,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:53:50,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:53:50,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:53:50,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:50,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312603684] [2025-04-29 10:53:50,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312603684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:50,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:50,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:53:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366862812] [2025-04-29 10:53:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:50,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:53:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:50,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:53:50,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:53:50,329 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:50,341 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2025-04-29 10:53:50,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:53:50,341 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 10:53:50,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:50,342 INFO L225 Difference]: With dead ends: 73 [2025-04-29 10:53:50,342 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 10:53:50,342 INFO L436 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-04-29 10:53:50,343 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:50,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:53:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 10:53:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2025-04-29 10:53:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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-04-29 10:53:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-04-29 10:53:50,346 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 29 [2025-04-29 10:53:50,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:50,347 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-04-29 10:53:50,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:50,347 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-04-29 10:53:50,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 10:53:50,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:50,347 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:50,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:53:50,348 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:50,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 387173897, now seen corresponding path program 1 times [2025-04-29 10:53:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:50,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999396368] [2025-04-29 10:53:50,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:50,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:53:50,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:53:50,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:50,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:51,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999396368] [2025-04-29 10:53:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999396368] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:51,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682489301] [2025-04-29 10:53:51,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:51,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:53:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:53:51,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:53:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:53:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:51,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:51,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-29 10:53:51,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:51,161 INFO L354 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-04-29 10:53:51,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:53:51,207 INFO L354 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-04-29 10:53:51,258 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:53:51,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:53:51,266 INFO L354 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-04-29 10:53:51,282 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:53:51,282 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2025-04-29 10:53:51,287 INFO L354 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 13 treesize of output 9 [2025-04-29 10:53:51,357 INFO L325 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-04-29 10:53:51,357 INFO L354 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 33 treesize of output 51 [2025-04-29 10:53:51,442 INFO L354 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 23 treesize of output 11 [2025-04-29 10:53:51,458 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-29 10:53:51,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-04-29 10:53:51,475 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-29 10:53:51,475 INFO L354 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 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-29 10:53:51,627 INFO L325 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2025-04-29 10:53:51,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 76 [2025-04-29 10:53:51,651 INFO L325 Elim1Store]: treesize reduction 38, result has 37.7 percent of original size [2025-04-29 10:53:51,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 76 [2025-04-29 10:53:51,677 INFO L325 Elim1Store]: treesize reduction 38, result has 41.5 percent of original size [2025-04-29 10:53:51,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 72 [2025-04-29 10:53:51,751 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:53:51,754 INFO L354 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 28 treesize of output 22 [2025-04-29 10:53:52,044 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 10:53:52,044 INFO L354 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 28 [2025-04-29 10:53:52,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:53:52,050 INFO L354 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 15 treesize of output 7 [2025-04-29 10:53:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:52,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:52,429 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:52,430 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2025-04-29 10:53:52,465 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:52,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1394 treesize of output 1388 [2025-04-29 10:53:52,482 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:52,482 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 506 treesize of output 474 [2025-04-29 10:53:52,521 INFO L354 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 6 treesize of output 4 [2025-04-29 10:53:52,528 INFO L354 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 6 treesize of output 4 [2025-04-29 10:53:56,419 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,437 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,455 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:56,455 INFO L354 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 48 treesize of output 52 [2025-04-29 10:53:56,485 INFO L325 Elim1Store]: treesize reduction 60, result has 32.6 percent of original size [2025-04-29 10:53:56,485 INFO L354 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 103 treesize of output 93 [2025-04-29 10:53:56,503 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,514 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,525 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:56,526 INFO L354 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 139 treesize of output 143 [2025-04-29 10:53:56,618 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,634 INFO L325 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-04-29 10:53:56,635 INFO L354 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 86 treesize of output 1 [2025-04-29 10:53:56,645 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,660 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:56,660 INFO L354 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 132 treesize of output 136 [2025-04-29 10:53:56,712 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,719 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,723 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 10:53:56,728 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 10:53:56,751 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 10:53:56,757 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 10:53:56,766 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,781 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 10:53:56,788 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-29 10:53:56,799 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,810 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,828 INFO L325 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-04-29 10:53:56,828 INFO L354 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 86 treesize of output 1 [2025-04-29 10:53:56,834 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:56,848 INFO L354 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 21 treesize of output 3 [2025-04-29 10:53:57,624 INFO L325 Elim1Store]: treesize reduction 60, result has 32.6 percent of original size [2025-04-29 10:53:57,624 INFO L354 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 459 treesize of output 413 [2025-04-29 10:53:57,676 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:57,676 INFO L354 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 722 treesize of output 690 [2025-04-29 10:53:57,762 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:57,762 INFO L354 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 75 treesize of output 79 [2025-04-29 10:53:57,802 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:57,802 INFO L354 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 247 treesize of output 233 [2025-04-29 10:53:57,869 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:57,869 INFO L354 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 255 treesize of output 241 [2025-04-29 10:53:57,942 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:57,943 INFO L354 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 213 treesize of output 217 [2025-04-29 10:53:58,014 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,015 INFO L354 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 178 treesize of output 182 [2025-04-29 10:53:58,050 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,050 INFO L354 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 204 treesize of output 208 [2025-04-29 10:53:58,098 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,099 INFO L354 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 285 treesize of output 269 [2025-04-29 10:53:58,174 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,174 INFO L354 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 255 treesize of output 241 [2025-04-29 10:53:58,242 INFO L325 Elim1Store]: treesize reduction 60, result has 32.6 percent of original size [2025-04-29 10:53:58,242 INFO L354 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 2140 treesize of output 1986 [2025-04-29 10:53:58,282 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,282 INFO L354 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 722 treesize of output 690 [2025-04-29 10:53:58,362 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,362 INFO L354 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 75 treesize of output 79 [2025-04-29 10:53:58,411 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,411 INFO L354 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 225 treesize of output 211 [2025-04-29 10:53:58,442 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,442 INFO L354 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 276 treesize of output 274 [2025-04-29 10:53:58,612 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,613 INFO L354 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 173 treesize of output 173 [2025-04-29 10:53:58,701 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,702 INFO L354 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 234 treesize of output 220 [2025-04-29 10:53:58,746 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,746 INFO L354 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 276 treesize of output 244 [2025-04-29 10:53:58,801 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,801 INFO L354 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 861 treesize of output 827 [2025-04-29 10:53:58,950 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,951 INFO L354 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 234 treesize of output 220 [2025-04-29 10:53:59,004 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,004 INFO L354 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 255 treesize of output 241 [2025-04-29 10:53:59,064 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,064 INFO L354 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 246 treesize of output 232 [2025-04-29 10:53:59,107 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,107 INFO L354 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 213 treesize of output 217 [2025-04-29 10:53:59,155 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,156 INFO L354 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 178 treesize of output 182 [2025-04-29 10:53:59,178 INFO L354 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 160 treesize of output 142 [2025-04-29 10:53:59,190 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,190 INFO L354 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 204 treesize of output 208 [2025-04-29 10:53:59,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,222 INFO L354 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 220 treesize of output 206 [2025-04-29 10:53:59,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,267 INFO L354 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 220 treesize of output 206 [2025-04-29 10:53:59,305 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,306 INFO L354 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 199 treesize of output 185 [2025-04-29 10:53:59,334 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,334 INFO L354 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 226 treesize of output 210 [2025-04-29 10:53:59,385 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,385 INFO L354 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 246 treesize of output 232 [2025-04-29 10:53:59,420 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,421 INFO L354 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 225 treesize of output 211 [2025-04-29 10:53:59,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,459 INFO L354 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 267 treesize of output 235 [2025-04-29 10:53:59,507 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,508 INFO L354 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 225 treesize of output 211 [2025-04-29 10:53:59,536 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,537 INFO L354 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 313 treesize of output 311 [2025-04-29 10:53:59,650 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,651 INFO L354 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 410 treesize of output 408 [2025-04-29 10:53:59,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,872 INFO L354 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 246 treesize of output 232 [2025-04-29 10:53:59,918 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,918 INFO L354 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 255 treesize of output 241 [2025-04-29 10:53:59,977 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,977 INFO L354 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 213 treesize of output 217 [2025-04-29 10:54:00,021 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,022 INFO L354 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 178 treesize of output 182 [2025-04-29 10:54:00,052 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,053 INFO L354 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 204 treesize of output 208 [2025-04-29 10:54:00,093 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,094 INFO L354 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 220 treesize of output 206 [2025-04-29 10:54:00,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,128 INFO L354 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 173 treesize of output 173 [2025-04-29 10:54:00,200 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,200 INFO L354 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 764 treesize of output 714 [2025-04-29 10:54:00,304 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,304 INFO L354 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 948 treesize of output 896 [2025-04-29 10:54:00,443 INFO L325 Elim1Store]: treesize reduction 60, result has 32.6 percent of original size [2025-04-29 10:54:00,443 INFO L354 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 1114 treesize of output 1032 [2025-04-29 10:54:00,487 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,488 INFO L354 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 722 treesize of output 690 [2025-04-29 10:54:00,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,548 INFO L354 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 75 treesize of output 79 [2025-04-29 10:54:00,596 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,596 INFO L354 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 207 treesize of output 193 [2025-04-29 10:54:00,631 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,632 INFO L354 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 734 treesize of output 702 [2025-04-29 10:54:00,699 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,702 INFO L354 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 743 treesize of output 711 [2025-04-29 10:54:00,793 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,793 INFO L354 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 708 treesize of output 676 [2025-04-29 10:54:00,831 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,831 INFO L354 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 701 treesize of output 687 [2025-04-29 10:54:00,898 INFO L354 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 611 [2025-04-29 10:54:00,917 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,918 INFO L354 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 225 treesize of output 211 [2025-04-29 10:54:00,947 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,947 INFO L354 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 713 treesize of output 681 [2025-04-29 10:54:00,997 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:00,997 INFO L354 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 773 treesize of output 739 [2025-04-29 10:54:01,089 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,089 INFO L354 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 713 treesize of output 681 [2025-04-29 10:54:01,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,137 INFO L354 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 687 treesize of output 655 [2025-04-29 10:54:01,169 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,169 INFO L354 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 722 treesize of output 690 [2025-04-29 10:54:01,234 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,234 INFO L354 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 713 treesize of output 681 [2025-04-29 10:54:01,284 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,284 INFO L354 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 234 treesize of output 220 [2025-04-29 10:54:01,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,322 INFO L354 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 722 treesize of output 690 [2025-04-29 10:54:01,396 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,397 INFO L354 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 417 treesize of output 415 [2025-04-29 10:54:01,640 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,640 INFO L354 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 213 treesize of output 217 [2025-04-29 10:54:01,685 INFO L354 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 160 treesize of output 142 [2025-04-29 10:54:01,701 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,702 INFO L354 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 743 treesize of output 711 [2025-04-29 10:54:01,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,772 INFO L354 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 708 treesize of output 676 [2025-04-29 10:54:01,814 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,815 INFO L354 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 734 treesize of output 702 [2025-04-29 10:54:01,884 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,884 INFO L354 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 225 treesize of output 211 [2025-04-29 10:54:01,918 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,918 INFO L354 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 549 treesize of output 527 [2025-04-29 10:54:02,166 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,166 INFO L354 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 410 treesize of output 408 [2025-04-29 10:54:02,374 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,374 INFO L354 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 246 treesize of output 232 [2025-04-29 10:54:02,421 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,421 INFO L354 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 255 treesize of output 241 [2025-04-29 10:54:02,499 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,499 INFO L354 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 213 treesize of output 217 [2025-04-29 10:54:02,535 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,536 INFO L354 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 178 treesize of output 182 [2025-04-29 10:54:02,561 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,561 INFO L354 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 204 treesize of output 208 [2025-04-29 10:54:02,588 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,588 INFO L354 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 220 treesize of output 206 [2025-04-29 10:54:02,626 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,626 INFO L354 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 755 treesize of output 705 [2025-04-29 10:54:02,675 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,675 INFO L354 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 398 treesize of output 396 [2025-04-29 10:54:02,856 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,856 INFO L354 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 701 treesize of output 687 [2025-04-29 10:54:02,917 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,917 INFO L354 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 734 treesize of output 702 [2025-04-29 10:54:02,977 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,977 INFO L354 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 743 treesize of output 711 [2025-04-29 10:54:03,035 INFO L354 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 44 treesize of output 42 [2025-04-29 10:54:03,048 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,048 INFO L354 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 701 treesize of output 687 [2025-04-29 10:54:03,118 INFO L354 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 53 treesize of output 51 [2025-04-29 10:54:03,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,132 INFO L354 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 10 treesize of output 8 [2025-04-29 10:54:03,145 INFO L325 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-04-29 10:54:03,146 INFO L354 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 255 treesize of output 1 [2025-04-29 10:54:03,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,159 INFO L325 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-04-29 10:54:03,159 INFO L354 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 213 treesize of output 1 [2025-04-29 10:54:03,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,168 INFO L354 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 53 treesize of output 51 [2025-04-29 10:54:03,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,189 INFO L354 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 45 treesize of output 27 [2025-04-29 10:54:03,201 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,202 INFO L354 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 225 treesize of output 211 [2025-04-29 10:54:03,232 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,232 INFO L354 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 722 treesize of output 690 [2025-04-29 10:54:03,303 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,303 INFO L354 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 383 treesize of output 349 [2025-04-29 10:54:03,435 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,435 INFO L354 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 234 treesize of output 220 [2025-04-29 10:54:03,484 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,484 INFO L354 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 225 treesize of output 211 [2025-04-29 10:54:03,513 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,513 INFO L354 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 713 treesize of output 681 [2025-04-29 10:54:03,558 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,558 INFO L354 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 199 treesize of output 185 [2025-04-29 10:54:03,584 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,585 INFO L354 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 687 treesize of output 655 [2025-04-29 10:54:03,616 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,616 INFO L354 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 225 treesize of output 211 [2025-04-29 10:54:03,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,647 INFO L354 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 316 treesize of output 300 [2025-04-29 10:54:03,838 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,838 INFO L354 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 107 treesize of output 111 [2025-04-29 10:54:03,843 INFO L354 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 217 treesize of output 211 [2025-04-29 10:54:03,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,895 INFO L354 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 1168 treesize of output 1136 [2025-04-29 10:54:03,940 INFO L354 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 10 treesize of output 8 [2025-04-29 10:54:03,945 INFO L354 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 358 treesize of output 322 [2025-04-29 10:54:03,962 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,963 INFO L354 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 454 treesize of output 438 [2025-04-29 10:54:03,975 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:04,026 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,026 INFO L354 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 1168 treesize of output 1136 [2025-04-29 10:54:04,034 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:04,086 INFO L354 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 358 treesize of output 322 [2025-04-29 10:54:04,095 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,095 INFO L354 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 61 treesize of output 65 [2025-04-29 10:54:04,127 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,127 INFO L354 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 454 treesize of output 438 [2025-04-29 10:54:04,193 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,193 INFO L354 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 475 treesize of output 441 [2025-04-29 10:54:04,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 24 [2025-04-29 10:54:04,241 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,241 INFO L354 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 454 treesize of output 438 [2025-04-29 10:54:04,246 INFO L354 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 21 treesize of output 3 [2025-04-29 10:54:04,326 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:04,337 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,337 INFO L354 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 52 treesize of output 56 [2025-04-29 10:54:04,368 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:04,395 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:04,407 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,407 INFO L354 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 1265 treesize of output 1243 [2025-04-29 10:54:04,659 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,659 INFO L354 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 1297 treesize of output 1227 [2025-04-29 10:54:04,665 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:04,712 INFO L354 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 358 treesize of output 322 [2025-04-29 10:54:04,720 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,721 INFO L354 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 126 treesize of output 128 [2025-04-29 10:54:04,809 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,809 INFO L354 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 1189 treesize of output 1139 [2025-04-29 10:54:04,873 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,873 INFO L354 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 2011 treesize of output 1925 [2025-04-29 10:54:04,881 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:04,937 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:04,937 INFO L354 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 1168 treesize of output 1136 [2025-04-29 10:54:04,946 INFO L354 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 21 treesize of output 3 [2025-04-29 10:54:05,018 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,018 INFO L354 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 1393 treesize of output 1325 [2025-04-29 10:54:05,025 INFO L354 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 190 treesize of output 188 [2025-04-29 10:54:05,142 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,142 INFO L354 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 1189 treesize of output 1139 [2025-04-29 10:54:05,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 24 [2025-04-29 10:54:05,190 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,191 INFO L354 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 325 treesize of output 327 [2025-04-29 10:54:05,198 INFO L354 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 1122 treesize of output 1100 [2025-04-29 10:54:05,381 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,381 INFO L354 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 454 treesize of output 438 [2025-04-29 10:54:05,387 INFO L354 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 21 treesize of output 3 [2025-04-29 10:54:05,473 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,474 INFO L354 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 1990 treesize of output 1922 [2025-04-29 10:54:05,483 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:05,534 INFO L354 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 53 treesize of output 51 [2025-04-29 10:54:05,546 INFO L354 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 53 treesize of output 51 [2025-04-29 10:54:05,552 INFO L354 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 10 treesize of output 8 [2025-04-29 10:54:05,561 INFO L354 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 810 treesize of output 790 [2025-04-29 10:54:05,570 INFO L354 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 96 treesize of output 92 [2025-04-29 10:54:05,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:05,579 INFO L354 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 360 treesize of output 324 [2025-04-29 10:54:05,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:05,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:05,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:05,593 INFO L354 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 360 treesize of output 324 [2025-04-29 10:54:05,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:05,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:05,600 INFO L354 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 1182 treesize of output 1110 [2025-04-29 10:54:05,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:05,616 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,616 INFO L354 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 1276 treesize of output 1224 [2025-04-29 10:54:05,621 INFO L354 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 21 treesize of output 3 [2025-04-29 10:54:05,679 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,679 INFO L354 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 1168 treesize of output 1136 [2025-04-29 10:54:05,729 INFO L354 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 10 treesize of output 8 [2025-04-29 10:54:05,737 INFO L354 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 358 treesize of output 322 [2025-04-29 10:54:05,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,759 INFO L354 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 454 treesize of output 438 [2025-04-29 10:54:05,764 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:05,834 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,834 INFO L354 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 1168 treesize of output 1136 [2025-04-29 10:54:05,852 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:05,891 INFO L354 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 358 treesize of output 322 [2025-04-29 10:54:05,899 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,899 INFO L354 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 61 treesize of output 65 [2025-04-29 10:54:05,932 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,932 INFO L354 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 454 treesize of output 438 [2025-04-29 10:54:05,990 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:05,990 INFO L354 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 1990 treesize of output 1922 [2025-04-29 10:54:05,999 INFO L354 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 21 treesize of output 3 [2025-04-29 10:54:06,058 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,059 INFO L354 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 454 treesize of output 438 [2025-04-29 10:54:06,063 INFO L354 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 21 treesize of output 3 [2025-04-29 10:54:06,104 INFO L354 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 1180 treesize of output 1108 [2025-04-29 10:54:06,113 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,113 INFO L354 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 40 treesize of output 44 [2025-04-29 10:54:06,147 INFO L354 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 358 treesize of output 322 [2025-04-29 10:54:06,154 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,154 INFO L354 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 40 treesize of output 44 [2025-04-29 10:54:06,196 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,197 INFO L354 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 1276 treesize of output 1224 [2025-04-29 10:54:06,207 INFO L354 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 21 treesize of output 3 [2025-04-29 10:54:06,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,288 INFO L354 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 2011 treesize of output 1925 [2025-04-29 10:54:06,339 INFO L354 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 1201 treesize of output 1111 [2025-04-29 10:54:06,377 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,377 INFO L354 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 1313 treesize of output 1245 [2025-04-29 10:54:06,444 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,444 INFO L354 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 1022 treesize of output 972 [2025-04-29 10:54:06,655 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,656 INFO L354 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 475 treesize of output 441 [2025-04-29 10:54:06,697 INFO L354 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 379 treesize of output 325 [2025-04-29 10:54:06,724 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,724 INFO L354 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 453 treesize of output 421 [2025-04-29 10:54:06,777 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,777 INFO L354 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 415 treesize of output 383 [2025-04-29 10:54:06,920 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:06,921 INFO L354 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 1167 treesize of output 1149 [2025-04-29 10:54:06,935 INFO L354 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 342 treesize of output 340 [2025-04-29 10:54:07,102 INFO L354 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 1180 treesize of output 1108 [2025-04-29 10:54:07,112 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,112 INFO L354 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 126 treesize of output 128 [2025-04-29 10:54:07,206 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,206 INFO L354 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 210 treesize of output 212 [2025-04-29 10:54:07,213 INFO L354 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 363 treesize of output 355 [2025-04-29 10:54:07,319 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,320 INFO L354 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 1990 treesize of output 1922 [2025-04-29 10:54:07,341 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:07,436 INFO L354 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 1180 treesize of output 1108 [2025-04-29 10:54:07,448 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,449 INFO L354 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 61 treesize of output 65 [2025-04-29 10:54:07,491 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,491 INFO L354 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 1276 treesize of output 1224 [2025-04-29 10:54:07,497 INFO L354 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 42 treesize of output 24 [2025-04-29 10:54:07,554 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,554 INFO L354 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 1297 treesize of output 1227 [2025-04-29 10:54:07,594 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,594 INFO L354 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 514 treesize of output 482 [2025-04-29 10:54:07,599 INFO L354 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 133 treesize of output 131 [2025-04-29 10:54:07,704 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,705 INFO L354 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 255 treesize of output 241 [2025-04-29 10:54:07,751 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,752 INFO L354 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 225 treesize of output 211 [2025-04-29 10:54:07,780 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,780 INFO L354 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 213 treesize of output 217 [2025-04-29 10:54:07,842 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,843 INFO L354 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 178 treesize of output 182 [2025-04-29 10:54:07,871 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,872 INFO L354 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 204 treesize of output 208 [2025-04-29 10:54:07,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,909 INFO L354 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 713 treesize of output 681 [2025-04-29 10:54:07,958 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:07,958 INFO L354 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 276 treesize of output 274 [2025-04-29 10:54:08,093 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,093 INFO L354 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 743 treesize of output 711 [2025-04-29 10:54:08,150 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,151 INFO L354 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 708 treesize of output 676 [2025-04-29 10:54:08,183 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,183 INFO L354 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 734 treesize of output 702 [2025-04-29 10:54:08,260 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,261 INFO L354 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 234 treesize of output 220 [2025-04-29 10:54:08,303 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,303 INFO L354 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 220 treesize of output 206 [2025-04-29 10:54:08,330 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,330 INFO L354 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 199 treesize of output 185 [2025-04-29 10:54:08,359 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,359 INFO L354 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 226 treesize of output 210 [2025-04-29 10:54:08,403 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,404 INFO L354 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 773 treesize of output 739 [2025-04-29 10:54:08,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,549 INFO L354 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 713 treesize of output 681 [2025-04-29 10:54:08,597 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,598 INFO L354 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 687 treesize of output 655 [2025-04-29 10:54:08,629 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,629 INFO L354 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 722 treesize of output 690 [2025-04-29 10:54:08,689 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,689 INFO L354 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 722 treesize of output 690 [2025-04-29 10:54:08,747 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,747 INFO L354 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 225 treesize of output 211 [2025-04-29 10:54:08,773 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,773 INFO L354 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 246 treesize of output 232 [2025-04-29 10:54:08,823 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:08,823 INFO L354 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 234 treesize of output 220 [2025-04-29 10:54:09,224 INFO L354 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-04-29 10:54:09,246 INFO L354 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-04-29 10:54:09,251 INFO L354 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-04-29 10:54:09,259 INFO L354 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-04-29 10:54:09,300 INFO L354 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-04-29 10:54:09,311 INFO L354 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-04-29 10:54:09,318 INFO L354 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-04-29 10:54:09,325 INFO L354 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-04-29 10:54:09,329 INFO L354 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-04-29 10:54:09,336 INFO L354 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-04-29 10:54:09,396 INFO L354 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-04-29 10:54:09,411 INFO L354 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-04-29 10:54:09,735 INFO L354 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-04-29 10:54:09,862 INFO L354 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-04-29 10:54:09,866 INFO L354 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-04-29 10:54:10,108 INFO L354 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-04-29 10:54:10,248 INFO L354 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-04-29 10:54:10,346 INFO L354 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-04-29 10:54:10,406 INFO L354 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-04-29 10:54:10,411 INFO L354 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-04-29 10:54:10,413 INFO L354 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-04-29 10:54:10,427 INFO L354 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-04-29 10:54:10,457 INFO L354 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-04-29 10:54:10,469 INFO L354 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-04-29 10:54:10,488 INFO L354 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-04-29 10:54:10,500 INFO L354 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-04-29 10:54:10,678 INFO L354 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-04-29 10:54:10,710 INFO L354 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-04-29 10:54:10,716 INFO L354 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-04-29 10:54:10,725 INFO L354 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-04-29 10:54:10,845 INFO L354 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-04-29 10:54:10,856 INFO L354 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-04-29 10:54:10,908 INFO L354 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-04-29 10:54:10,972 INFO L354 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-04-29 10:54:10,983 INFO L354 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-04-29 10:54:11,028 INFO L354 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-04-29 10:54:11,079 INFO L354 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-04-29 10:54:11,109 INFO L354 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-04-29 10:54:11,155 INFO L354 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-04-29 10:54:11,168 INFO L354 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-04-29 10:54:11,196 INFO L354 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-04-29 10:54:11,210 INFO L354 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-04-29 10:54:11,262 INFO L354 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-04-29 10:54:11,268 INFO L354 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-04-29 10:54:11,277 INFO L354 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-04-29 10:54:11,283 INFO L354 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-04-29 10:54:13,643 INFO L354 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 37 treesize of output 25 [2025-04-29 10:54:15,103 INFO L354 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 37 treesize of output 25 [2025-04-29 10:54:15,875 INFO L354 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 30 treesize of output 22 [2025-04-29 10:54:15,903 INFO L354 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 38 treesize of output 26 [2025-04-29 10:54:15,907 INFO L354 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-04-29 10:54:16,353 INFO L354 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 41 treesize of output 29 [2025-04-29 10:54:20,816 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse45 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse3))) (let ((.cse20 (not .cse45)) (.cse10 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse156 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse410 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse410 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse410) 0)) (= .cse410 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse410 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse336 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse409 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse409) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse409 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse409 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse409)) (= .cse409 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse300 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse408 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse408) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse408 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse408 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse408)) (= .cse408 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (let ((.cse9 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse111 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse407 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse407) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse407 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse407)) (= .cse407 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse407 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (.cse54 (and .cse336 .cse300)) (.cse89 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse406 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse406) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse406 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse406)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse406 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (.cse190 (or .cse4 (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse405 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse405 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse405) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse405 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse405)) (= .cse405 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse299 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse403 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse403) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse404 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse403 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse404 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse404)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse403 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse403)) (= .cse403 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse233 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse402 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse402) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse402 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse402 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse402 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (.cse170 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse401 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse401 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse401) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse401 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse401 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse401)))))) (.cse16 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse400 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse400) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse400 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse400 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse400 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse19 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse399 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse399) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse399 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse399 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse399 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse83 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse398 (select v_arrayElimArr_3 .cse3))) (let ((.cse397 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse398 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse397 .cse398) (not (= (select |c_#valid| .cse398) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse398 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= .cse397 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse398 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse84 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse396 (select v_arrayElimArr_3 .cse3))) (let ((.cse395 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse396 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse395 .cse396) (not (= (select |c_#valid| .cse396) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse396 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse395 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse396 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse214 (or .cse45 .cse10 .cse156)) (.cse215 (or .cse20 .cse156)) (.cse47 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse394 (select v_arrayElimArr_3 .cse3))) (let ((.cse393 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse394 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse393 .cse394) (not (= (select |c_#valid| .cse394) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse394 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse393 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse48 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse392 (select v_arrayElimArr_3 .cse3))) (let ((.cse391 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse392 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse391 .cse392) (not (= (select |c_#valid| .cse392) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse392 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= .cse391 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse353 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse389 (select v_arrayElimArr_3 .cse3))) (let ((.cse390 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse389 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse389) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse389 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= .cse390 .cse389)) (= .cse390 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse354 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse387 (select v_arrayElimArr_3 .cse3))) (let ((.cse388 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse387 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse387) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse387 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (not (= .cse388 .cse387)) (= .cse388 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (let ((.cse58 (and .cse353 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse385 (select v_arrayElimArr_3 .cse3))) (let ((.cse386 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse385 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse384 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse385 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse384 .cse3) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse384)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (not (= (select |c_#valid| .cse385) 0)) (not (= .cse386 .cse385)) (= .cse386 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse354)) (.cse52 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse383 (select v_arrayElimArr_3 .cse3))) (let ((.cse382 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse383 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse382 .cse383) (not (= (select |c_#valid| .cse383) 0)) (= .cse382 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse57 (let ((.cse378 (and .cse47 .cse48))) (and (or .cse20 .cse4 .cse378) (or .cse45 .cse4 .cse378) (or .cse45 (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse380 (select v_arrayElimArr_3 .cse3))) (let ((.cse379 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse380 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse379 .cse380) (not (= (select |c_#valid| .cse380) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse381 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse380 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse381 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse381)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (= .cse379 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse48) .cse4)))) (.cse78 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse377 (select v_arrayElimArr_3 .cse3))) (let ((.cse376 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse377 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse376 .cse377) (not (= (select |c_#valid| .cse377) 0)) (= .cse376 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse377 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (.cse63 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse374 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse374 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse374) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse375 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse374 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse375 .cse374) (= .cse375 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse374 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse374 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse72 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse372 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse372) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse373 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse372 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse373 .cse372) (= .cse373 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse372 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse372 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse372 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (.cse59 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse371 (select v_arrayElimArr_3 .cse3))) (let ((.cse370 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse371 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse370 .cse371) (not (= (select |c_#valid| .cse371) 0)) (= .cse370 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse371 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse371 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (.cse88 (and .cse336 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse369 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse368 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse369 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse368 .cse3) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse368)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (not (= (select |c_#valid| .cse369) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse369 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse369)) (= .cse369 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse300)) (.cse14 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse367 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse367 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse367) 0)) (= .cse367 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse367 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse367 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_4 .cse3) 0))))) (.cse36 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse366 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse366 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse366 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse366) 0)) (= .cse366 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse366 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (.cse24 (and .cse214 .cse215)) (.cse75 (and .cse83 .cse84)) (.cse97 (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse365 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse365 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse365) 0)) (= .cse365 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse365 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse117 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse363 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse363 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse363) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse364 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse363 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse364 .cse363) (= .cse364 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse363 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (.cse124 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse361 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse361) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse362 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse361 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse362 .cse361) (= .cse362 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse361 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse361 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (.cse125 (and .cse16 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse360 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse359 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse360 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse359 .cse3) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse359)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (not (= (select |c_#valid| .cse360) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse360 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse360 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse19)) (.cse112 (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse358 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse358 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse358 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse358) 0)))))) (.cse167 (and .cse170 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse357 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse357 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse357) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse357 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse357 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse357))))))) (.cse107 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse355 (select v_arrayElimArr_3 .cse3))) (let ((.cse356 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse355 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse355) 0)) (not (= .cse356 .cse355)) (= .cse356 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse355 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (.cse91 (and .cse353 .cse354)) (.cse186 (and (or .cse45 .cse10 .cse233) (or .cse45 .cse10 (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse352 (select v_arrayElimArr_3 .cse3))) (let ((.cse351 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse352 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse351 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse352) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse352 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse352 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse351)))))) (or .cse20 .cse233))) (.cse56 (and .cse190 .cse299)) (.cse283 (or .cse89 .cse4)) (.cse284 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse350 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse350) 0)) (= .cse350 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse350 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse350)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse350 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (.cse55 (or .cse54 .cse20)) (.cse232 (or .cse45 .cse111 .cse10)) (.cse228 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse349 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse349 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse349) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse349 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (.cse90 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse348 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse348 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse348) (not (= .cse348 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse348) 0)))))) (.cse246 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse347 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse347) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse347 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse347)) (= .cse347 |c_ULTIMATE.start_main_~p~0#1.base|))))) (.cse11 (not .cse9))) (and (or (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1487 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_3 .cse3))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse1 v_prenex_1487) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) (not (= (select |c_#valid| .cse1) 0)) (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse1 .cse0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1486 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse6 v_prenex_1486) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse5) (= .cse6 .cse5)))) (not (= (select |c_#valid| .cse6) 0)) (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse7) 0)) (forall ((v_prenex_1490 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse7 v_prenex_1490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse8 .cse7)))) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9) (or .cse10 .cse11 (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_498 Int)) (or (not (= 0 (select |c_#valid| v_arrayElimCell_498))) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimCell_498) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_arrayElimCell_498 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse12 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse12) 0)) (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1554 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse12 v_prenex_1554) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse13)))) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse12 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) .cse14 (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1555 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse15) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse15 v_prenex_1555) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse15 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse4)) .cse9) (or .cse11 (and (or (and .cse16 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse17 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse17) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse17 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse18)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse17 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse19) .cse10) (or .cse20 (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse21 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse21) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse21 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse21 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3)))))))) .cse16 .cse19)))) (or .cse10 .cse11 (forall ((v_prenex_1507 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse23 (select v_arrayElimArr_3 .cse3))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse23 v_prenex_1507) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 .cse23) (not (= (select |c_#valid| .cse23) 0)) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or .cse24 .cse11) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse25) 0)) (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1524 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse25 v_prenex_1524) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse26) (= .cse25 .cse26)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse25 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse28 (select v_arrayElimArr_3 .cse3))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse28 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse27 .cse28) (not (= (select |c_#valid| .cse28) 0)) (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse28 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse29 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse29) 0)) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1523 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse29 v_prenex_1523) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse29)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse29 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse9) (or (and (or .cse4 (forall ((v_ArrVal_249 (Array Int Int)) (v_prenex_1603 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse30 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse30 v_prenex_1603) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select |c_#valid| .cse30) 0)) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse30 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_prenex_1603 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse31 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse31 v_prenex_1603) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse31 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse31) 0)) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse33 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1602 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse33 v_prenex_1602) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse33) 0)) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse33 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) .cse14 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse35 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1602 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse35 v_prenex_1602) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse35 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse35) 0)) (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse36) .cse9) (or (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse37 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse37) 0)) (= .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse37 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse37 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse38 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse38) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse38 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse38 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1497 (Array Int Int))) (let ((.cse40 (select v_arrayElimArr_3 .cse3))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse40 v_prenex_1497) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse39) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse39) (not (= (select |c_#valid| .cse40) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse40 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))))) (or (and (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1498 (Array Int Int))) (let ((.cse41 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse41) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse41 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse41 v_prenex_1498) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1498 (Array Int Int))) (let ((.cse42 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse42) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse42 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse42 v_prenex_1498) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1497 (Array Int Int))) (let ((.cse44 (select v_arrayElimArr_3 .cse3))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse44 v_prenex_1497) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse43) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse43) (not (= (select |c_#valid| .cse44) 0)) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse44 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))))))))) .cse9) (or (let ((.cse46 (and .cse47 .cse48 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse50 (select v_arrayElimArr_3 .cse3))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse50 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse50 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse49 .cse3) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse49)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (= .cse51 .cse50) (not (= (select |c_#valid| .cse50) 0)) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) (and (or .cse45 .cse46 .cse4) (or .cse46 .cse20 .cse4))) .cse10 .cse11) (or .cse52 .cse10 .cse11 .cse4) (or .cse10 .cse11 (forall ((v_prenex_1484 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse53 (select v_arrayElimArr_3 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse53 v_prenex_1484) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select |c_#valid| .cse53) 0)) (= .cse53 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse4) (or .cse10 (and (or .cse45 .cse54) .cse55 (or .cse45 .cse56)) .cse11) (or .cse57 .cse10) (or .cse10 .cse58 .cse11) (or (and (or .cse45 .cse59 .cse10) (or .cse59 .cse20) (or .cse45 .cse10 (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse62 (select v_arrayElimArr_3 .cse3))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse62 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse60 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse62 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse61 .cse62) (not (= (select |c_#valid| .cse62) 0)) (= .cse61 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse60))))))) .cse11) (or (and .cse63 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse65 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1556 (Array Int Int))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse65 v_prenex_1556) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse64 .cse65) (= .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse64 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select |c_#valid| .cse65) 0)) (= .cse65 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse65 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse65 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse67 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1556 (Array Int Int))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse67 v_prenex_1556) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse66 .cse67) (= .cse66 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse66 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse67 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse67) 0)) (= .cse67 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse67 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1557 (Array Int Int))) (let ((.cse68 (select v_arrayElimArr_3 .cse3))) (let ((.cse69 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse68 v_prenex_1557) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse68 .cse69) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse69 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse68 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse68) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69) (= .cse68 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4) (or .cse4 (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1557 (Array Int Int))) (let ((.cse70 (select v_arrayElimArr_3 .cse3))) (let ((.cse71 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse70 v_prenex_1557) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse70 .cse71) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse71 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select |c_#valid| .cse70) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse71) (= .cse70 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse70 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) .cse72) .cse9) (or .cse10 .cse11 (forall ((v_prenex_1517 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse73 (select v_arrayElimArr_3 .cse3))) (let ((.cse74 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse73 v_prenex_1517) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse73 .cse74) (= .cse74 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse73) 0)))))) .cse4) (or .cse10 .cse11 .cse4 .cse75) (or (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse77 (select v_arrayElimArr_3 .cse3))) (let ((.cse76 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse77 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse76 .cse77) (not (= (select |c_#valid| .cse77) 0)) (= .cse77 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse76 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse77 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse78 .cse4)) .cse9) (or .cse10 .cse11 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse79 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse79 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse79) (not (= (select |c_#valid| .cse79) 0)) (= .cse79 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse79 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (or .cse11 (and (or (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse81 (select v_arrayElimArr_3 .cse3))) (let ((.cse80 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse81 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse80 .cse81) (not (= (select |c_#valid| .cse81) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse82 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse81 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse82)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (= .cse80 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse81 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse83 .cse84) .cse10) (or .cse20 (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse86 (select v_arrayElimArr_3 .cse3))) (let ((.cse85 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse86 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse85 .cse86) (not (= (select |c_#valid| .cse86) 0)) (= .cse85 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse86 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse86 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3))))))))) .cse83 .cse84))) .cse4) (or .cse10 .cse11 (and (or .cse45 .cse58 .cse4) (or .cse20 .cse58 .cse4))) (or .cse10 .cse11 .cse4 (forall ((v_prenex_1616 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse87 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse87 v_prenex_1616) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse87) 0)) (= .cse87 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse10 .cse88 .cse11) (or .cse89 .cse10 .cse11 .cse4) (or .cse10 .cse11 .cse4 (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_499 Int)) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| v_arrayElimCell_499) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_arrayElimCell_499 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (and (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_502 Int)) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_arrayElimCell_502 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select |c_#valid| v_arrayElimCell_502) 0)))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimCell_502 Int)) (or (= v_arrayElimCell_502 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_arrayElimCell_502 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select |c_#valid| v_arrayElimCell_502) 0))))))) .cse9) (or .cse10 .cse90 .cse4) (or .cse10 .cse11 (and (or .cse4 .cse91) (or .cse20 .cse4 .cse91))) (or (and (or .cse52 .cse4) (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse93 (select v_arrayElimArr_3 .cse3))) (let ((.cse92 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse93 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse92 .cse93) (not (= (select |c_#valid| .cse93) 0)) (= .cse93 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse92 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse9) (or (and (or (forall ((v_prenex_1614 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse94 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse94) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse94 v_prenex_1614) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse95 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse95) 0)) (forall ((v_prenex_1613 (Array Int Int))) (let ((.cse96 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse95 v_prenex_1613) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse96 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse96)))) (= .cse95 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse95 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse97) .cse9) (or (and (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse98 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse98 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse98) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse99 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse98 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse99 .cse98) (= .cse99 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse100 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse100 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse100) 0)) (forall ((v_prenex_1471 (Array Int Int))) (= .cse100 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse100 v_prenex_1471) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) .cse9) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse101 (select v_arrayElimArr_3 .cse3))) (let ((.cse102 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse101 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse101) 0)) (= .cse101 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse102 .cse101)) (= .cse102 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse101 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse103 (select v_arrayElimArr_3 .cse3))) (let ((.cse104 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse103 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse103 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse103) 0)) (not (= .cse104 .cse103)) (= .cse104 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse105 (select v_arrayElimArr_3 .cse3))) (let ((.cse106 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse105 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse105 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse105) 0)) (= .cse105 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse106 .cse105)) (= .cse106 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (or .cse4 .cse107)) .cse9) (or .cse10 .cse11 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1551 (Array Int Int))) (let ((.cse109 (select v_arrayElimArr_3 .cse3))) (let ((.cse108 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse109 v_prenex_1551) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse108 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse108 .cse109) (not (= (select |c_#valid| .cse109) 0)) (= .cse109 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse110 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse110 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse110) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse110 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse9) (or .cse57 .cse10 .cse11) (or .cse111 .cse10 .cse11) (or (and .cse112 (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse113 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse113 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse113) 0)) (forall ((v_prenex_1495 (Array Int Int))) (let ((.cse114 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse113 v_prenex_1495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse114) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse114)))))))) .cse9) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse115 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1479 (Array Int Int))) (let ((.cse116 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse115 v_prenex_1479) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse115 .cse116) (= .cse116 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse116 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse115 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse115) 0)) (= .cse115 |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse117 (or (forall ((v_ArrVal_249 (Array Int Int)) (v_prenex_1480 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse119 (select v_arrayElimArr_3 .cse3))) (let ((.cse118 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse119 v_prenex_1480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse118 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select |c_#valid| .cse119) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118) (= .cse119 .cse118) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse119 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse120 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1479 (Array Int Int))) (let ((.cse121 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse120 v_prenex_1479) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse120 .cse121) (= .cse121 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse121 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse120) 0)) (= .cse120 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse120 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_prenex_1480 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse123 (select v_arrayElimArr_3 .cse3))) (let ((.cse122 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse123 v_prenex_1480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse122 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse123 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse123) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse122) (= .cse123 .cse122))))) .cse4) .cse124) .cse9) (or .cse78 .cse10 .cse11) (or .cse10 (and (or .cse45 .cse125 .cse4) (or .cse125 .cse4)) .cse11) (or (let ((.cse126 (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse127 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse127) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse127 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse127 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse129 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse128 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse129 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse128 .cse3) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse128)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (not (= (select |c_#valid| .cse129) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse129 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse130 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse130) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse130 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse130 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|))))))) (and (or .cse45 .cse126 .cse4) (or .cse20 .cse126 .cse4))) .cse10 .cse11) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse131 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse131 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse131) 0)) (= .cse131 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1573 (Array Int Int))) (let ((.cse132 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse131 v_prenex_1573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse132 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse132 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse132 .cse131)))) (= .cse131 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse63 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse133 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse133) 0)) (= .cse133 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1573 (Array Int Int))) (let ((.cse134 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse133 v_prenex_1573) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse134 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse134 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse134 .cse133)))) (= .cse133 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse133 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) .cse72 (or (and (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1577 (Array Int Int))) (let ((.cse136 (select v_arrayElimArr_3 .cse3))) (let ((.cse135 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse136 v_prenex_1577) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse135 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse136) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse136 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse135 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse135 .cse136) (= .cse136 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1576 (Array Int Int))) (let ((.cse137 (select v_arrayElimArr_3 .cse3))) (let ((.cse139 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse137 v_prenex_1576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse137) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse138 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse137 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse138 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse138)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (= .cse139 .cse137) (= .cse139 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse137 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1576 (Array Int Int))) (let ((.cse140 (select v_arrayElimArr_3 .cse3))) (let ((.cse141 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse140 v_prenex_1576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse140) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse140 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= .cse141 .cse140) (= .cse141 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse140 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse142 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse142 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse142) 0)) (forall ((v_prenex_1576 (Array Int Int))) (let ((.cse143 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse142 v_prenex_1576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse143 .cse142) (= .cse143 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse142 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1576 (Array Int Int))) (let ((.cse144 (select v_arrayElimArr_3 .cse3))) (let ((.cse145 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse144 v_prenex_1576) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse144) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse144 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse145 .cse144) (= .cse145 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse144 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse147 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1577 (Array Int Int))) (let ((.cse146 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse147 v_prenex_1577) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse146 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse146 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse146 .cse147)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse147 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse147) 0)) (= .cse147 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1577 (Array Int Int))) (let ((.cse149 (select v_arrayElimArr_3 .cse3))) (let ((.cse148 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse149 v_prenex_1577) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse148 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse149) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse150 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse149 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse150 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse150)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (= .cse148 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse148 .cse149) (= .cse149 |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1577 (Array Int Int))) (let ((.cse152 (select v_arrayElimArr_3 .cse3))) (let ((.cse151 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse152 v_prenex_1577) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse151 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse152) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse152 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (= .cse151 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse151 .cse152) (= .cse152 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse4)) .cse9) (or .cse59 .cse10 .cse11) (or .cse10 .cse11 (and (or .cse45 .cse88 .cse4) (or .cse88 .cse4))) (or .cse10 .cse11 (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimCell_497 Int)) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| v_arrayElimCell_497) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimCell_497) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) v_arrayElimCell_497 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse153 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse153 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= .cse153 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse153) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse153 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse155 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1467 (Array Int Int))) (let ((.cse154 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse155 v_prenex_1467) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse154) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse154)))) (not (= .cse155 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse155) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse155 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse9) (or .cse10 .cse156 .cse11) (or (and (or (forall ((v_ArrVal_249 (Array Int Int)) (v_prenex_1619 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse157 (select v_arrayElimArr_3 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse157 v_prenex_1619) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse157) 0)) (= .cse157 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse157 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse4) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_prenex_1619 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse158 (select v_arrayElimArr_3 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse158 v_prenex_1619) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse158 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse158) 0)) (= .cse158 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse4) .cse14 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse159 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse159) 0)) (= .cse159 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse159 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_prenex_1618 (Array Int Int))) (let ((.cse160 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse159 v_prenex_1618) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse160) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse160)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse159 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse161 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse161 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse161) 0)) (= .cse161 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse161 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_prenex_1618 (Array Int Int))) (let ((.cse162 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse161 v_prenex_1618) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse162) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse162))))))))) .cse36) .cse9) (or .cse24 .cse11 .cse4) (or .cse10 .cse11 .cse75) (or (and (or (forall ((v_prenex_1482 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse163 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse163) 0)) (= .cse163 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse163 v_prenex_1482) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse4) .cse97 (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse164 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse164) 0)) (forall ((v_prenex_1481 (Array Int Int))) (let ((.cse165 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse164 v_prenex_1481) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse165 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse165 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= .cse164 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse164 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9) (or .cse10 .cse11 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1483 (Array Int Int))) (let ((.cse166 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse166 v_prenex_1483) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse166) 0)) (= .cse166 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or (and (or .cse45 .cse167 .cse4) (or .cse167 .cse20 .cse4) (or .cse45 (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse168 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse168 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse168) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse169 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse168 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse169 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse169)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse168 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse168))))) .cse170) .cse4)) .cse10 .cse11) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse171 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse171) 0)) (= .cse171 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1590 (Array Int Int))) (= .cse171 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse171 v_prenex_1590) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (= .cse171 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse171 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (or (let ((.cse178 (= |c_ULTIMATE.start_main_~p~0#1.offset| 0))) (and (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse173 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1593 (Array Int Int))) (let ((.cse172 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse173 v_prenex_1593) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse172) (= .cse173 .cse172)))) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (let ((.cse174 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse173 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse174 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse174)))) (not (= (select |c_#valid| .cse173) 0)) (= .cse173 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse175 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse175 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (not (= (select |c_#valid| .cse175) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse175 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse175)) (= .cse175 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1593 (Array Int Int))) (let ((.cse176 (select v_arrayElimArr_3 .cse3))) (let ((.cse177 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse176 v_prenex_1593) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse176 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse177) (not (= (select |c_#valid| .cse176) 0)) (= .cse176 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse176 .cse177))))) .cse178) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse179 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse179 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse179) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse179 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse179) 0)) (= .cse179 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse178) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse181 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1593 (Array Int Int))) (let ((.cse180 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse181 v_prenex_1593) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse180) (= .cse181 .cse180)))) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse181 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (not (= (select |c_#valid| .cse181) 0)) (= .cse181 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse183 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (let ((.cse182 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse183 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse182 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse182)))) (not (= (select |c_#valid| .cse183) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse183 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse183)) (= .cse183 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse184 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse184) 0)) (= .cse184 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse184 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_prenex_1594 (Array Int Int))) (let ((.cse185 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse184 v_prenex_1594) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse185 .cse184) (= .cse185 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse184 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse9) (or .cse186 .cse11 .cse4) (or (and .cse97 (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse188 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1473 (Array Int Int))) (let ((.cse187 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse188 v_prenex_1473) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse187) (= .cse187 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse188) 0)) (= .cse188 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse188 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1474 (Array Int Int))) (let ((.cse189 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse189) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse189 v_prenex_1474) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse189 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse4)) .cse9) (or (and .cse190 (or .cse111 .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse191 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse191 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse191) 0)) (= .cse191 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse191 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse191)) (= .cse191 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse192 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse192) 0)) (= .cse192 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse192 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse192)) (= .cse192 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse192 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse9) (or .cse10 .cse11 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1600 (Array Int Int))) (let ((.cse194 (select v_arrayElimArr_3 .cse3))) (let ((.cse193 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse194 v_prenex_1600) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse193 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse193 .cse194) (not (= (select |c_#valid| .cse194) 0)) (= .cse194 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and (or (forall ((v_prenex_1559 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse196 (select v_arrayElimArr_3 .cse3))) (let ((.cse195 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse196 v_prenex_1559) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse195 .cse196) (not (= (select |c_#valid| .cse196) 0)) (= .cse196 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse195 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse198 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1558 (Array Int Int))) (let ((.cse197 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse198 v_prenex_1558) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse197 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse197) (= .cse198 .cse197)))) (not (= (select |c_#valid| .cse198) 0)) (= .cse198 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse198 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse199 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse199) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse200 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse199 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse200 .cse199) (= .cse200 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse199 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse199 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9) (or .cse10 .cse11 .cse4 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse201 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse201 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse201) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse201 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|))))) (or (and (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse203 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1494 (Array Int Int))) (let ((.cse202 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse203 v_prenex_1494) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse202) (= .cse203 .cse202)))) (not (= (select |c_#valid| .cse203) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse203 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse204 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse204 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_prenex_1494 (Array Int Int))) (let ((.cse205 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse204 v_prenex_1494) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse205) (= .cse204 .cse205)))) (not (= (select |c_#valid| .cse204) 0))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse206 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1493 (Array Int Int))) (let ((.cse207 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse206 v_prenex_1493) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse206 .cse207) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse207) (= .cse207 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse206 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse206) 0))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse208 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1493 (Array Int Int))) (let ((.cse209 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse208 v_prenex_1493) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse208 .cse209) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse209) (= .cse209 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse208) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse208 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse211 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1492 (Array Int Int))) (let ((.cse210 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse211 v_prenex_1492) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse210 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse211 .cse210) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse210)))) (not (= (select |c_#valid| .cse211) 0)) (= .cse211 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse211 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse212 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse212 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (forall ((v_prenex_1492 (Array Int Int))) (let ((.cse213 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse212 v_prenex_1492) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse213 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse212 .cse213) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse213)))) (not (= (select |c_#valid| .cse212) 0)) (= .cse212 |c_ULTIMATE.start_main_~a~0#1.base|)))))) .cse117 .cse124) .cse9) (or .cse11 (and (or .cse45 .cse54 .cse10) .cse55)) (or (and .cse214 .cse215 (or .cse45 .cse10 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse217 (select v_arrayElimArr_3 .cse3))) (let ((.cse216 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse217 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse216 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse217 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse217) 0)) (= .cse217 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse216))))))) .cse11) (or .cse9 (and (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse219 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1515 (Array Int Int))) (let ((.cse218 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse219 v_prenex_1515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse218 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse218 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse218 .cse219)))) (not (= (select |c_#valid| .cse219) 0)) (= .cse219 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse220 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse220) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse221 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse220 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse221 .cse220) (= .cse221 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse220 |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (forall ((v_prenex_1516 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse223 (select v_arrayElimArr_3 .cse3))) (let ((.cse222 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse223 v_prenex_1516) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse222 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse223) 0)) (= .cse222 .cse223))))) .cse4))) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse224 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1470 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse224 v_prenex_1470) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse224)) (not (= .cse224 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse224) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse224 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse225 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse225 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse225) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse226 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse225 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse226 .cse225) (= .cse226 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse225 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse9) (or .cse10 .cse125 .cse11) (or .cse10 .cse11 (and (or .cse54 .cse4) (or .cse54 .cse20 .cse4))) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse227 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse227 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse227) 0)) (= .cse227 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse227 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (or .cse228 .cse4)) .cse9) (or (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse229 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse229) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse229 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse229 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse10 .cse11) (or (and .cse112 (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse230 (select v_arrayElimArr_3 .cse3))) (or (not (= .cse230 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse230) 0)) (forall ((v_prenex_1465 (Array Int Int))) (let ((.cse231 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse230 v_prenex_1465) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse231 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse231 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) .cse9) (or (and (or .cse111 .cse20) .cse232) .cse11) (or .cse10 .cse11 .cse233) (or .cse10 .cse11 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1560 (Array Int Int))) (let ((.cse234 (select v_arrayElimArr_3 .cse3))) (let ((.cse235 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse234 v_prenex_1560) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse234) 0)) (= .cse235 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse234 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse234 .cse235))))) .cse4) (or .cse10 .cse11 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse236 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select |c_#valid| .cse236) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse236 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse236 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse4) (or .cse167 .cse9) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse237 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse237 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select |c_#valid| .cse237) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (let ((.cse238 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse237 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse238 .cse237) (= .cse238 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse237 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse237 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse239 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse239 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_prenex_1558 (Array Int Int))) (let ((.cse240 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse239 v_prenex_1558) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse240 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse240) (= .cse239 .cse240)))) (not (= (select |c_#valid| .cse239) 0)) (= .cse239 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse239 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_prenex_1559 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse241 (select v_arrayElimArr_3 .cse3))) (let ((.cse242 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse241 v_prenex_1559) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse241 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse242 .cse241) (not (= (select |c_#valid| .cse241) 0)) (= .cse241 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse242 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4)) .cse9) (or .cse10 .cse11 .cse107) (or .cse10 .cse11 (and (or .cse20 .cse91) (or .cse45 .cse91))) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1501 (Array Int Int))) (let ((.cse243 (select v_arrayElimArr_3 .cse3))) (let ((.cse244 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse243 v_prenex_1501) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse243 .cse244) (not (= (select |c_#valid| .cse243) 0)) (= .cse243 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse244))))) .cse10 .cse11) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1475 (Array Int Int))) (let ((.cse245 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse245) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse245 v_prenex_1475) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse245 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse10 .cse11) (or .cse10 .cse246 .cse11) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse247 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse247 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse247) 0)) (= .cse247 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse247 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse248 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse248) 0)) (= .cse248 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1468 (Array Int Int))) (let ((.cse249 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse248 v_prenex_1468) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse249) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse249)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse248 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1469 (Array Int Int))) (let ((.cse250 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse250 v_prenex_1469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select |c_#valid| .cse250) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse250 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse4)) .cse9) (or .cse10 .cse11 .cse4 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1476 (Array Int Int))) (let ((.cse251 (select v_arrayElimArr_3 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse251 v_prenex_1476) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select |c_#valid| .cse251) 0)) (= .cse251 |c_ULTIMATE.start_main_~p~0#1.base|))))) (or .cse10 .cse11 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse253 (select v_arrayElimArr_3 .cse3))) (let ((.cse252 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse253 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= .cse252 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse252 .cse253) (not (= (select |c_#valid| .cse253) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse253 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (or (and (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse254 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse254) 0)) (forall ((v_ArrVal_250 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse254 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse254)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse254 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse255 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1520 (Array Int Int))) (let ((.cse256 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse255 v_prenex_1520) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse255 .cse256) (= .cse256 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse255) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse255 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse257 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1522 (Array Int Int))) (let ((.cse258 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse257 v_prenex_1522) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse257 .cse258) (= .cse258 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse257) 0)) (= .cse257 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse257 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse259 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse259) 0)) (forall ((v_prenex_1521 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse259 v_prenex_1521) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse259)) (= .cse259 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse259 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse9) (or (forall ((v_prenex_1615 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse260 (select v_arrayElimArr_3 .cse3))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse260 v_prenex_1615) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select |c_#valid| .cse260) 0)) (= .cse260 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse10 .cse11) (or .cse10 .cse11 (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse262 (select v_arrayElimArr_3 .cse3))) (let ((.cse263 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse262 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse261 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse262 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse261 .cse3) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse261)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (= .cse263 .cse262) (not (= (select |c_#valid| .cse262) 0)) (= .cse263 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse262 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse83 .cse84)) (or .cse10 .cse11 (forall ((v_prenex_1561 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse265 (select v_arrayElimArr_3 .cse3))) (let ((.cse264 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse265 v_prenex_1561) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse264) (not (= (select |c_#valid| .cse265) 0)) (= .cse265 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse265 .cse264)))))) (or .cse10 .cse11 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1488 (Array Int Int))) (let ((.cse266 (select v_arrayElimArr_3 .cse3))) (let ((.cse267 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse266 v_prenex_1488) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select |c_#valid| .cse266) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse267) (= .cse266 .cse267) (= .cse266 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (or (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1598 (Array Int Int))) (let ((.cse269 (select v_arrayElimArr_3 .cse3))) (let ((.cse268 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse269 v_prenex_1598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse268 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select |c_#valid| .cse269) 0)) (= .cse268 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse269 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse268 .cse269))))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse271 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1597 (Array Int Int))) (let ((.cse270 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse271 v_prenex_1597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse270 .cse271) (= .cse270 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse270 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse271) 0)) (= .cse271 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse271 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse272 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse272 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select |c_#valid| .cse272) 0)) (= .cse272 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1599 (Array Int Int))) (let ((.cse273 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse272 v_prenex_1599) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse273 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse273 .cse272)))) (= .cse272 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse274 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse274) 0)) (= .cse274 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1599 (Array Int Int))) (let ((.cse275 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse274 v_prenex_1599) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse275 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse275 .cse274)))) (= .cse274 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse276 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse276 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_prenex_1597 (Array Int Int))) (let ((.cse277 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse276 v_prenex_1597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse277 .cse276) (= .cse277 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse277 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse276) 0)) (= .cse276 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse276 |c_ULTIMATE.start_main_~p~0#1.base|))))))) .cse9) (or .cse186 .cse11) (or (and (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse278 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse278) 0)) (= .cse278 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1604 (Array Int Int))) (let ((.cse279 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse278 v_prenex_1604) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse279 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse279 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse278 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse280 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse280) 0)) (= .cse280 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1606 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse280 v_prenex_1606) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse280 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (forall ((v_prenex_1605 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse281 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse281) 0)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse281 v_prenex_1605) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse281 |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse4)) .cse9) (or .cse11 (and .cse55 (or .cse45 .cse56 .cse10) .cse232)) (or (and (or (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse282 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse282 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse282) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse282 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse282))))) .cse4) .cse283 .cse284 (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse285 (select v_arrayElimArr_3 .cse3))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse285 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| .cse285) 0)) (= .cse285 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse285 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse285)))))))) .cse9) (or (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1511 (Array Int Int))) (let ((.cse287 (select v_arrayElimArr_3 .cse3))) (let ((.cse286 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse287 v_prenex_1511) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse286 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse286) (not (= (select |c_#valid| .cse287) 0)) (= .cse287 .cse286) (= .cse287 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse289 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1514 (Array Int Int))) (let ((.cse288 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse289 v_prenex_1514) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse288) (= .cse289 .cse288)))) (not (= (select |c_#valid| .cse289) 0)) (= .cse289 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse289 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse291 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1510 (Array Int Int))) (let ((.cse290 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse291 v_prenex_1510) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse290 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse290 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse290 .cse291)))) (not (= (select |c_#valid| .cse291) 0)) (= .cse291 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse291 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse292 (select v_arrayElimArr_3 .cse3))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse292 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse292) (not (= (select |c_#valid| .cse292) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse292 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse10 .cse11 .cse4) (or (and .cse283 .cse284) .cse9) (or (let ((.cse294 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse298 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse298 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse298) (not (= .cse298 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse298) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse298 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0)))))))))) (let ((.cse293 (and .cse294 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse297 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse297 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse297) (not (= .cse297 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse297) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse297 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))))) (and (or .cse20 .cse4 .cse293) (or .cse45 .cse4 .cse293) (or (and .cse294 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse295 (select v_arrayElimArr_3 .cse3))) (or (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse295 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse295) (not (= .cse295 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select |c_#valid| .cse295) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse296 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse295 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse296 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse296)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))))))) .cse4)))) .cse10) (or (and .cse55 (or .cse45 .cse10 (and .cse299 .cse300)) .cse232) .cse11 .cse4) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1512 (Array Int Int))) (let ((.cse302 (select v_arrayElimArr_3 .cse3))) (let ((.cse301 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse302 v_prenex_1512) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse301 .cse302) (not (= (select |c_#valid| .cse302) 0)) (= .cse302 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse301 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse10 .cse11) (or .cse10 .cse228 .cse11 .cse4) (or (forall ((v_prenex_1518 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse304 (select v_arrayElimArr_3 .cse3))) (let ((.cse303 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse304 v_prenex_1518) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse303) (= .cse304 .cse303) (not (= (select |c_#valid| .cse304) 0)) (= .cse304 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse10 .cse11) (or (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_prenex_1500 (Array Int Int))) (let ((.cse306 (select v_arrayElimArr_3 .cse3))) (let ((.cse305 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse306 v_prenex_1500) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse305 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse305 .cse306) (= .cse305 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select |c_#valid| .cse306) 0)))))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse307 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse307) 0)) (forall ((v_prenex_1499 (Array Int Int))) (let ((.cse308 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse307 v_prenex_1499) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse308 .cse307) (= .cse308 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse308 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= .cse307 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse309 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse309) 0)) (= .cse309 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_prenex_1503 (Array Int Int))) (let ((.cse310 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse309 v_prenex_1503) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse310 .cse309) (= .cse310 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) .cse9) (or .cse10 .cse11 .cse90 .cse4) (or (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse311 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse311) 0)) (= .cse311 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse311 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse311)) (= .cse311 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or .cse246 .cse4)) .cse9) (or (and (or (forall ((v_prenex_1550 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse313 (select v_arrayElimArr_3 .cse3))) (let ((.cse312 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse313 v_prenex_1550) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse312 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse312 .cse313) (not (= (select |c_#valid| .cse313) 0)) (= .cse313 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4) (or .cse4 (forall ((v_prenex_1549 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse315 (select v_arrayElimArr_3 .cse3))) (let ((.cse314 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse315 v_prenex_1549) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse314 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse314 .cse315) (not (= (select |c_#valid| .cse315) 0)) (= .cse315 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse314 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse317 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1553 (Array Int Int))) (let ((.cse316 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse317 v_prenex_1553) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse316) (= .cse317 .cse316)))) (not (= (select |c_#valid| .cse317) 0)) (= .cse317 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse317 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse319 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1548 (Array Int Int))) (let ((.cse318 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse319 v_prenex_1548) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse318 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse318 .cse319) (= .cse318 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select |c_#valid| .cse319) 0)) (= .cse319 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse319 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9) (or (let ((.cse323 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse325 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse325) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse325 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse325 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse325))))))) (let ((.cse320 (and .cse323 (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse324 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse324) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse324 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse324 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse324)))))))) (and (or .cse20 .cse320 .cse4) (or .cse45 .cse320 .cse4) (or (and (forall ((v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse321 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse321) 0)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int))) (let ((.cse322 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse321 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse322 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse322)))) (not (= (select v_arrayElimArr_4 .cse3) 0)))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse321 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse321))))) .cse323) .cse4)))) .cse10 .cse11) (or (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse327 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1610 (Array Int Int))) (let ((.cse326 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse327 v_prenex_1610) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse326 .cse327) (= .cse326 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse327) 0)) (= .cse327 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse327 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse327 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse330 (select v_arrayElimArr_3 .cse3))) (let ((.cse328 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse330 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse328 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_prenex_1610 (Array Int Int))) (let ((.cse329 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse330 v_prenex_1610) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse329 .cse330) (= .cse329 |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= (select |c_#valid| .cse330) 0)) (= .cse330 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse330 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse328))))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse331 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse331) 0)) (= .cse331 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse331 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_prenex_1609 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse331 v_prenex_1609) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse331)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse331 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse333 (select v_arrayElimArr_3 .cse3))) (let ((.cse332 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse333 v_ArrVal_250) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (= .cse332 .cse333) (not (= (select |c_#valid| .cse333) 0)) (= .cse332 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse333 |c_ULTIMATE.start_main_~p~0#1.base|) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse333 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse4) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse3) 0)) (forall ((v_ArrVal_249 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse335 (select v_arrayElimArr_3 .cse3))) (let ((.cse334 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) .cse335 v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse334 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select |c_#valid| .cse335) 0)) (= .cse335 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse335 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((v_prenex_1609 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse335 v_prenex_1609) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse335)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse334)))))))) .cse9) (or .cse10 (and .cse336 .cse299 .cse300) .cse11) (or (forall ((v_prenex_1607 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse337 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse337) 0)) (= .cse337 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse337 v_prenex_1607) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)))) .cse10 .cse11 .cse4) (or (and (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse338 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse338) 0)) (forall ((v_prenex_1504 (Array Int Int))) (let ((.cse339 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse338 v_prenex_1504) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse339) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse339) (= .cse338 .cse339)))) (= .cse338 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse338 |c_ULTIMATE.start_main_~p~0#1.base|)))) (or (and (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse340 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse340) 0)) (forall ((v_prenex_1506 (Array Int Int))) (let ((.cse341 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse340 v_prenex_1506) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse341 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse341 .cse340)))) (= .cse340 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse342 (select v_arrayElimArr_3 .cse3))) (or (not (= (select |c_#valid| .cse342) 0)) (forall ((v_prenex_1505 (Array Int Int))) (let ((.cse343 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse342 v_prenex_1505) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse343 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse343 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse343 .cse342)))) (= .cse342 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse4) (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse345 (select v_arrayElimArr_3 .cse3))) (or (forall ((v_prenex_1509 (Array Int Int))) (let ((.cse344 (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse345 v_prenex_1509) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse344 .cse345) (= .cse344 |c_ULTIMATE.start_main_~p~0#1.base|)))) (not (= (select |c_#valid| .cse345) 0)) (= .cse345 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse345 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9) (or (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) .cse9) (or (let ((.cse346 (and .cse16 .cse19))) (and (or .cse20 .cse346) (or .cse45 .cse10 .cse346))) .cse11 .cse4))))))) is different from true Killed by 15