./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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 ../sv-benchmarks/c/forester-heap/dll-reverse.i -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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:37:11,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:37:11,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:37:11,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:37:11,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:37:11,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:37:11,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:37:11,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:37:11,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:37:11,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:37:11,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:37:11,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:37:11,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:37:11,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:37:11,634 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:37:11,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:37:11,635 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:37:11,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:37:11,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:37:11,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:37:11,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:37:11,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:37:11,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:37:11,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:37:11,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:37:11,637 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2025-03-16 17:37:11,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:37:11,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:37:11,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:37:11,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:37:11,851 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:37:11,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2025-03-16 17:37:12,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442099cf9/ed43474edf6b46e6b89b67754bc9008f/FLAG8199d4f34 [2025-03-16 17:37:13,152 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:37:13,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2025-03-16 17:37:13,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442099cf9/ed43474edf6b46e6b89b67754bc9008f/FLAG8199d4f34 [2025-03-16 17:37:13,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442099cf9/ed43474edf6b46e6b89b67754bc9008f [2025-03-16 17:37:13,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:37:13,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:37:13,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:37:13,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:37:13,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:37:13,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35768e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13, skipping insertion in model container [2025-03-16 17:37:13,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:37:13,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2025-03-16 17:37:13,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2025-03-16 17:37:13,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2025-03-16 17:37:13,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:37:13,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:37:13,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2025-03-16 17:37:13,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2025-03-16 17:37:13,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2025-03-16 17:37:13,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:37:13,749 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:37:13,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13 WrapperNode [2025-03-16 17:37:13,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:37:13,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:37:13,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:37:13,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:37:13,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,784 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2025-03-16 17:37:13,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:37:13,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:37:13,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:37:13,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:37:13,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,806 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-03-16 17:37:13,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:37:13,814 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:37:13,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:37:13,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:37:13,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (1/1) ... [2025-03-16 17:37:13,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:37:13,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:13,835 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-03-16 17:37:13,836 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-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:37:13,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:37:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:37:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:37:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:37:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:37:13,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:37:13,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:37:13,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:37:13,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:37:14,084 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-16 17:37:14,084 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:37:14,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:37:14,094 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:37:14,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:37:14 BoogieIcfgContainer [2025-03-16 17:37:14,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:37:14,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:37:14,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:37:14,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:37:14,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:37:13" (1/3) ... [2025-03-16 17:37:14,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3514517d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:37:14, skipping insertion in model container [2025-03-16 17:37:14,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:13" (2/3) ... [2025-03-16 17:37:14,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3514517d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:37:14, skipping insertion in model container [2025-03-16 17:37:14,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:37:14" (3/3) ... [2025-03-16 17:37:14,103 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2025-03-16 17:37:14,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:37:14,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-reverse.i that has 1 procedures, 32 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2025-03-16 17:37:14,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:37:14,160 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35bce9b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:37:14,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-16 17:37:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 31 states have internal predecessors, (51), 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-03-16 17:37:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:37:14,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:14,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:37:14,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:14,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1899847874, now seen corresponding path program 1 times [2025-03-16 17:37:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304258199] [2025-03-16 17:37:14,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:14,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:37:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:37:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304258199] [2025-03-16 17:37:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304258199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:14,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:14,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:37:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129650700] [2025-03-16 17:37:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:14,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:37:14,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:14,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:37:14,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:37:14,317 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-16 17:37:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:14,328 INFO L93 Difference]: Finished difference Result 61 states and 97 transitions. [2025-03-16 17:37:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:37:14,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-16 17:37:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:14,333 INFO L225 Difference]: With dead ends: 61 [2025-03-16 17:37:14,334 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 17:37:14,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:37:14,339 INFO L435 NwaCegarLoop]: 40 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, 40 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-03-16 17:37:14,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:37:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 17:37:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-16 17:37:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-16 17:37:14,363 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 6 [2025-03-16 17:37:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:14,364 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-16 17:37:14,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-16 17:37:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-16 17:37:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:37:14,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:14,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:14,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:37:14,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:14,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1673649739, now seen corresponding path program 1 times [2025-03-16 17:37:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:14,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573998811] [2025-03-16 17:37:14,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:14,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:37:14,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:37:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:14,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:14,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:14,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573998811] [2025-03-16 17:37:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573998811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:14,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:37:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896397616] [2025-03-16 17:37:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:14,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:37:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:14,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:37:14,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:37:14,669 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:14,811 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-03-16 17:37:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:37:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:37:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:14,813 INFO L225 Difference]: With dead ends: 67 [2025-03-16 17:37:14,813 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 17:37:14,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:37:14,813 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:14,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 85 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:37:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 17:37:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2025-03-16 17:37:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.34375) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-16 17:37:14,818 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 9 [2025-03-16 17:37:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:14,818 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-16 17:37:14,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-16 17:37:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:37:14,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:14,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:14,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:37:14,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:14,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1673680235, now seen corresponding path program 1 times [2025-03-16 17:37:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98507764] [2025-03-16 17:37:14,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:14,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:14,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:37:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:37:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:14,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:14,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98507764] [2025-03-16 17:37:14,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98507764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:14,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:14,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:37:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913110779] [2025-03-16 17:37:14,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:14,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:37:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:14,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:37:14,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:37:14,865 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:14,928 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2025-03-16 17:37:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:37:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:37:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:14,929 INFO L225 Difference]: With dead ends: 60 [2025-03-16 17:37:14,929 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 17:37:14,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:37:14,930 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:14,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 50 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:37:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 17:37:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2025-03-16 17:37:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 41 states have internal predecessors, (52), 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-03-16 17:37:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-03-16 17:37:14,939 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 9 [2025-03-16 17:37:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:14,939 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-03-16 17:37:14,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-03-16 17:37:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 17:37:14,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:14,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:14,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:37:14,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:14,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1034938224, now seen corresponding path program 1 times [2025-03-16 17:37:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:14,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757724085] [2025-03-16 17:37:14,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:14,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:37:14,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:37:14,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:14,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:37:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:15,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757724085] [2025-03-16 17:37:15,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757724085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:37:15,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036200618] [2025-03-16 17:37:15,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:15,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:15,111 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-03-16 17:37:15,113 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-03-16 17:37:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 17:37:15,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 17:37:15,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:15,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:15,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 17:37:15,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:15,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:15,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-16 17:37:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:37:15,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:37:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:37:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036200618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:37:15,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:37:15,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-16 17:37:15,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838688278] [2025-03-16 17:37:15,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:37:15,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:37:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:15,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:37:15,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:37:15,397 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-03-16 17:37:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:15,541 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2025-03-16 17:37:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:37:15,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-16 17:37:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:15,542 INFO L225 Difference]: With dead ends: 48 [2025-03-16 17:37:15,543 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 17:37:15,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:37:15,544 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:15,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 37 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:37:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 17:37:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2025-03-16 17:37:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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-03-16 17:37:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-16 17:37:15,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2025-03-16 17:37:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:15,548 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-16 17:37:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-03-16 17:37:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-16 17:37:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:37:15,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:15,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:15,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:37:15,755 WARN L453 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-03-16 17:37:15,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:15,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -934339735, now seen corresponding path program 1 times [2025-03-16 17:37:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013207623] [2025-03-16 17:37:15,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:15,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:37:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:37:15,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013207623] [2025-03-16 17:37:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013207623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:37:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880473922] [2025-03-16 17:37:15,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:15,990 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-03-16 17:37:15,992 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-03-16 17:37:16,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:37:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:37:16,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:16,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:16,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 17:37:16,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:16,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:37:16,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:37:16,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:37:16,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:37:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-16 17:37:16,210 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-16 17:37:16,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-16 17:37:16,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-16 17:37:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:16,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:37:16,298 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-16 17:37:16,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 113 [2025-03-16 17:37:16,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:16,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 167 [2025-03-16 17:37:16,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2025-03-16 17:37:16,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-16 17:37:16,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:16,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2025-03-16 17:37:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880473922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:37:16,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:37:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-16 17:37:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654134882] [2025-03-16 17:37:16,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:37:16,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 17:37:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:16,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 17:37:16,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:37:16,658 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:16,931 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2025-03-16 17:37:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:37:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-16 17:37:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:16,932 INFO L225 Difference]: With dead ends: 71 [2025-03-16 17:37:16,932 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 17:37:16,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-16 17:37:16,933 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 163 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 150 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:37:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 17:37:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2025-03-16 17:37:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-03-16 17:37:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-03-16 17:37:16,943 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 18 [2025-03-16 17:37:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:16,943 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-03-16 17:37:16,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-03-16 17:37:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:37:16,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:16,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:16,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:37:17,144 WARN L453 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-03-16 17:37:17,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash 808470600, now seen corresponding path program 1 times [2025-03-16 17:37:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240886454] [2025-03-16 17:37:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:17,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:37:17,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:37:17,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:17,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:37:17,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:17,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240886454] [2025-03-16 17:37:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240886454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:17,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:37:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091605361] [2025-03-16 17:37:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:17,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:37:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:17,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:37:17,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:37:17,254 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:37:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:17,370 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-16 17:37:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:37:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:37:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:17,371 INFO L225 Difference]: With dead ends: 69 [2025-03-16 17:37:17,371 INFO L226 Difference]: Without dead ends: 55 [2025-03-16 17:37:17,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:37:17,373 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:17,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:37:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-16 17:37:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-03-16 17:37:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 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-03-16 17:37:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-03-16 17:37:17,378 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 18 [2025-03-16 17:37:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:17,378 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-03-16 17:37:17,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:37:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-03-16 17:37:17,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:37:17,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:17,379 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:17,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:37:17,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:17,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1129854465, now seen corresponding path program 2 times [2025-03-16 17:37:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:17,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807022396] [2025-03-16 17:37:17,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:37:17,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:17,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-16 17:37:17,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:37:17,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:37:17,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:18,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:18,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807022396] [2025-03-16 17:37:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807022396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:37:18,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988332293] [2025-03-16 17:37:18,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:37:18,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:18,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:18,036 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-03-16 17:37:18,037 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-03-16 17:37:18,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-16 17:37:18,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:37:18,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:37:18,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:18,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-16 17:37:18,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:18,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:37:18,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:37:18,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 72 [2025-03-16 17:37:18,237 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2025-03-16 17:37:18,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 142 [2025-03-16 17:37:18,247 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:37:18,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 100 [2025-03-16 17:37:18,261 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2025-03-16 17:37:18,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 192 [2025-03-16 17:37:18,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 73 [2025-03-16 17:37:18,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 106 [2025-03-16 17:37:18,280 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2025-03-16 17:37:18,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 196 [2025-03-16 17:37:18,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 79 [2025-03-16 17:37:18,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 112 [2025-03-16 17:37:18,306 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:37:18,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 78 [2025-03-16 17:37:18,328 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-03-16 17:37:18,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 166 [2025-03-16 17:37:18,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2025-03-16 17:37:18,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-16 17:37:18,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2025-03-16 17:37:18,346 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-03-16 17:37:18,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 5 [2025-03-16 17:37:18,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:37:18,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 106 [2025-03-16 17:37:18,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-16 17:37:18,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-16 17:37:18,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-16 17:37:18,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:37:18,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2025-03-16 17:37:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:18,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:37:18,489 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_431 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~prev~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~prev~0#1.offset|)) 1)) is different from false [2025-03-16 17:37:18,503 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (or (not (= v_ArrVal_427 (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_427 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse0 (select v_ArrVal_427 .cse0))))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_431) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) 1))) is different from false [2025-03-16 17:37:18,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (or (not (= v_ArrVal_427 (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_427 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse0 (select v_ArrVal_427 .cse0))))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_431) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 1))) is different from false [2025-03-16 17:37:18,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:18,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 93 [2025-03-16 17:37:18,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:18,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 551 treesize of output 414 [2025-03-16 17:37:18,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:18,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 283 [2025-03-16 17:37:18,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 204 [2025-03-16 17:37:21,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:21,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:21,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:21,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:21,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:21,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:22,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:23,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:26,166 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2025-03-16 17:37:26,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:26,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:26,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:26,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:37:26,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-03-16 17:37:26,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:37:26,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:26,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:26,211 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 100 [2025-03-16 17:37:26,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-03-16 17:37:26,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-03-16 17:37:26,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-03-16 17:37:26,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:37:26,254 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 100 [2025-03-16 17:37:26,260 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-03-16 17:37:26,271 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-03-16 17:37:26,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,300 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-03-16 17:37:26,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:37:26,312 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 122 [2025-03-16 17:37:26,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:26,378 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-03-16 17:37:26,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:26,389 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2025-03-16 17:37:26,398 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-03-16 17:37:26,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:37:26,427 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 115 [2025-03-16 17:37:26,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,472 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 138 [2025-03-16 17:37:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-16 17:37:26,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:26,548 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-03-16 17:37:26,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:26,557 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,560 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-16 17:37:26,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:26,580 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 115 [2025-03-16 17:37:26,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:26,659 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-03-16 17:37:26,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:26,667 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,670 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-16 17:37:26,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:26,690 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 115 [2025-03-16 17:37:26,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,742 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 115 [2025-03-16 17:37:26,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:26,835 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-03-16 17:37:26,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:26,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,851 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-16 17:37:26,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:26,870 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:26,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 115 [2025-03-16 17:37:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:26,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:26,974 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2025-03-16 17:37:26,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:26,985 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,989 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:26,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-16 17:37:27,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,015 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 138 [2025-03-16 17:37:27,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-16 17:37:27,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,080 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-03-16 17:37:27,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-16 17:37:27,088 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,092 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,096 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:37:27,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-03-16 17:37:27,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,108 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2025-03-16 17:37:27,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,162 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:37:27,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:27,169 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,172 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-16 17:37:27,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:27,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2025-03-16 17:37:27,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,242 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-03-16 17:37:27,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-16 17:37:27,250 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,256 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,261 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-03-16 17:37:27,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-03-16 17:37:27,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:27,281 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2025-03-16 17:37:27,338 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:37:27,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:27,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:27,369 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 122 [2025-03-16 17:37:27,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:27,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,448 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-03-16 17:37:27,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-16 17:37:27,457 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,462 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,466 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:37:27,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-03-16 17:37:27,469 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2025-03-16 17:37:27,475 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2025-03-16 17:37:27,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,530 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-03-16 17:37:27,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-16 17:37:27,543 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,550 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,554 INFO L349 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2025-03-16 17:37:27,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-03-16 17:37:27,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:27,577 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2025-03-16 17:37:27,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,635 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:37:27,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:27,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:27,674 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 122 [2025-03-16 17:37:27,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,739 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:37:27,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:27,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:27,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:27,762 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2025-03-16 17:37:27,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:27,812 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:37:27,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:27,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:27,837 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,837 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-03-16 17:37:27,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:37:27,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-16 17:37:27,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:27,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,854 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:27,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:27,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:27,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:27,875 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,875 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:27,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:27,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:27,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:27,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,895 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,895 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:27,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:27,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:27,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:27,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,916 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,917 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:27,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:27,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:27,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:27,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,942 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,943 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2025-03-16 17:37:27,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-16 17:37:27,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-16 17:37:27,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:27,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,972 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,972 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:27,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:27,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:27,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:27,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:27,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:27,997 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,997 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:27,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:28,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:28,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:28,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:28,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:28,025 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,026 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:28,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:28,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:28,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:28,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:28,057 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,058 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2025-03-16 17:37:28,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:28,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:28,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-16 17:37:28,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-16 17:37:28,090 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,090 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2025-03-16 17:37:28,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:28,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:28,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:28,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:28,116 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,117 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2025-03-16 17:37:28,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-16 17:37:28,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-16 17:37:28,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:28,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:28,148 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,148 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2025-03-16 17:37:28,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:37:28,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:37:28,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-16 17:37:28,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-16 17:37:28,179 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:37:28,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 122 [2025-03-16 17:37:28,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:37:28,237 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:37:28,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:37:28,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:28,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:37:28,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:37:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-16 17:37:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988332293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:37:31,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:37:31,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-03-16 17:37:31,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214177604] [2025-03-16 17:37:31,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:37:31,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 17:37:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:31,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 17:37:31,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=247, Unknown=18, NotChecked=102, Total=420 [2025-03-16 17:37:31,496 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:37,568 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-03-16 17:37:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 17:37:37,569 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 17:37:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:37,570 INFO L225 Difference]: With dead ends: 74 [2025-03-16 17:37:37,570 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 17:37:37,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=63, Invalid=308, Unknown=21, NotChecked=114, Total=506 [2025-03-16 17:37:37,570 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:37,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 189 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 195 Unchecked, 1.8s Time] [2025-03-16 17:37:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 17:37:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2025-03-16 17:37:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 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-03-16 17:37:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-03-16 17:37:37,578 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 19 [2025-03-16 17:37:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:37,578 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-03-16 17:37:37,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-03-16 17:37:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:37:37,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:37,579 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:37,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:37:37,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:37,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:37,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1129855426, now seen corresponding path program 1 times [2025-03-16 17:37:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310933447] [2025-03-16 17:37:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:37,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 17:37:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:37:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:37,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:37:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310933447] [2025-03-16 17:37:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310933447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:37:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357717683] [2025-03-16 17:37:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:37:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:37:37,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:37:37,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:37:37,810 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03-16 17:37:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:37,827 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2025-03-16 17:37:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:37:37,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 17:37:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:37,828 INFO L225 Difference]: With dead ends: 64 [2025-03-16 17:37:37,828 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 17:37:37,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:37:37,829 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:37,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:37:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 17:37:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2025-03-16 17:37:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 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-03-16 17:37:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-03-16 17:37:37,837 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 19 [2025-03-16 17:37:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:37,838 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-03-16 17:37:37,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03-16 17:37:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-03-16 17:37:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 17:37:37,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:37,838 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:37,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:37:37,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:37,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash 695365225, now seen corresponding path program 3 times [2025-03-16 17:37:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:37:37,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761552123] [2025-03-16 17:37:37,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:37:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:37:37,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-16 17:37:37,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:37:37,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 17:37:37,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:37:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761552123] [2025-03-16 17:37:38,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761552123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:37:38,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120426211] [2025-03-16 17:37:38,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:37:38,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:38,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:38,181 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:37:38,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:37:38,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-16 17:37:38,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:37:38,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 17:37:38,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:38,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-16 17:37:38,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:38,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:37:38,718 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:37:38,721 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:37:38,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 511 treesize of output 438 [2025-03-16 17:37:39,269 INFO L349 Elim1Store]: treesize reduction 908, result has 5.9 percent of original size [2025-03-16 17:37:39,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 1129 treesize of output 1091 [2025-03-16 17:37:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:37:39,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:37:39,302 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-03-16 17:37:39,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 196 [2025-03-16 17:37:39,327 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2025-03-16 17:37:39,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-16 17:37:39,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2025-03-16 17:37:39,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2025-03-16 17:37:39,529 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-16 17:37:39,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:37:39,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:39,731 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-16 17:37:39,736 INFO L158 Benchmark]: Toolchain (without parser) took 26252.96ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 104.7MB in the beginning and 307.8MB in the end (delta: -203.1MB). Peak memory consumption was 231.4MB. Max. memory is 16.1GB. [2025-03-16 17:37:39,736 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:37:39,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.70ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 86.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:37:39,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.72ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:37:39,736 INFO L158 Benchmark]: Boogie Preprocessor took 27.96ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:37:39,737 INFO L158 Benchmark]: IcfgBuilder took 281.31ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 63.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:37:39,737 INFO L158 Benchmark]: TraceAbstraction took 25639.02ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 63.2MB in the beginning and 307.8MB in the end (delta: -244.6MB). Peak memory consumption was 189.5MB. Max. memory is 16.1GB. [2025-03-16 17:37:39,737 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.70ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 86.1MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.72ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.96ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.2MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 281.31ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 63.2MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25639.02ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 63.2MB in the beginning and 307.8MB in the end (delta: -244.6MB). Peak memory consumption was 189.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-03-16 17:37:39,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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 ../sv-benchmarks/c/forester-heap/dll-reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:37:41,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:37:41,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 17:37:41,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:37:41,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:37:41,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:37:41,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:37:41,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:37:41,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:37:41,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:37:41,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:37:41,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:37:41,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:37:41,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:37:41,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:37:41,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:37:41,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:37:41,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:37:41,563 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2025-03-16 17:37:41,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:37:41,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:37:41,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:37:41,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:37:41,808 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:37:41,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2025-03-16 17:37:42,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2cb8d3c3/2b9052d943b244b69b0fbf7cd0a89d06/FLAGaed5177b3 [2025-03-16 17:37:43,187 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:37:43,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2025-03-16 17:37:43,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2cb8d3c3/2b9052d943b244b69b0fbf7cd0a89d06/FLAGaed5177b3 [2025-03-16 17:37:43,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2cb8d3c3/2b9052d943b244b69b0fbf7cd0a89d06 [2025-03-16 17:37:43,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:37:43,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:37:43,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:37:43,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:37:43,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:37:43,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ee1ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43, skipping insertion in model container [2025-03-16 17:37:43,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:37:43,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2025-03-16 17:37:43,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2025-03-16 17:37:43,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2025-03-16 17:37:43,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:37:43,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:37:43,827 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2025-03-16 17:37:43,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2025-03-16 17:37:43,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2025-03-16 17:37:43,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:37:43,855 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:37:43,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43 WrapperNode [2025-03-16 17:37:43,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:37:43,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:37:43,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:37:43,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:37:43,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,890 INFO L138 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2025-03-16 17:37:43,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:37:43,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:37:43,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:37:43,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:37:43,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,912 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-03-16 17:37:43,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:37:43,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:37:43,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:37:43,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:37:43,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (1/1) ... [2025-03-16 17:37:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:37:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:43,957 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-03-16 17:37:43,959 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-03-16 17:37:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-16 17:37:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-16 17:37:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:37:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:37:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:37:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:37:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:37:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:37:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:37:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-16 17:37:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-16 17:37:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 17:37:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 17:37:43,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:37:43,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:37:44,071 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:37:44,073 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:37:44,611 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-16 17:37:44,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:37:44,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:37:44,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:37:44,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:37:44 BoogieIcfgContainer [2025-03-16 17:37:44,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:37:44,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:37:44,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:37:44,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:37:44,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:37:43" (1/3) ... [2025-03-16 17:37:44,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436455c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:37:44, skipping insertion in model container [2025-03-16 17:37:44,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:37:43" (2/3) ... [2025-03-16 17:37:44,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436455c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:37:44, skipping insertion in model container [2025-03-16 17:37:44,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:37:44" (3/3) ... [2025-03-16 17:37:44,630 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2025-03-16 17:37:44,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:37:44,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-reverse.i that has 1 procedures, 32 locations, 1 initial locations, 8 loop locations, and 3 error locations. [2025-03-16 17:37:44,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:37:44,673 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f76c9b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:37:44,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-16 17:37:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 31 states have internal predecessors, (51), 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-03-16 17:37:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:37:44,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:44,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:37:44,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1899847874, now seen corresponding path program 1 times [2025-03-16 17:37:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:37:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672923201] [2025-03-16 17:37:44,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:44,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:44,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:44,695 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-03-16 17:37:44,697 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-03-16 17:37:44,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:37:44,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:37:44,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:44,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:44,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 17:37:44,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:44,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:37:44,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:37:44,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672923201] [2025-03-16 17:37:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672923201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:44,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:44,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:37:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032331952] [2025-03-16 17:37:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:44,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:37:44,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:37:44,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:37:44,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:37:44,812 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-16 17:37:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:44,822 INFO L93 Difference]: Finished difference Result 61 states and 97 transitions. [2025-03-16 17:37:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:37:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-16 17:37:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:44,828 INFO L225 Difference]: With dead ends: 61 [2025-03-16 17:37:44,828 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 17:37:44,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-03-16 17:37:44,832 INFO L435 NwaCegarLoop]: 40 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, 40 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-03-16 17:37:44,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:37:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 17:37:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-16 17:37:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-16 17:37:44,850 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 6 [2025-03-16 17:37:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:44,851 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-16 17:37:44,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03-16 17:37:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-16 17:37:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 17:37:44,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:44,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:44,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:37:45,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:45,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:45,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:45,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1673649739, now seen corresponding path program 1 times [2025-03-16 17:37:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:37:45,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177739910] [2025-03-16 17:37:45,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:45,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:45,055 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-03-16 17:37:45,056 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-03-16 17:37:45,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 17:37:45,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 17:37:45,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:45,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:45,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 17:37:45,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:45,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:37:45,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:37:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177739910] [2025-03-16 17:37:45,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177739910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:45,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:45,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:37:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251598869] [2025-03-16 17:37:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:45,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:37:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:37:45,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:37:45,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:37:45,159 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:45,570 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-16 17:37:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:37:45,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 17:37:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:45,572 INFO L225 Difference]: With dead ends: 53 [2025-03-16 17:37:45,572 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 17:37:45,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:37:45,572 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:45,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 50 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 17:37:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 17:37:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-03-16 17:37:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.375) internal successors, (44), 34 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-03-16 17:37:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-03-16 17:37:45,582 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 9 [2025-03-16 17:37:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:45,582 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-16 17:37:45,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-03-16 17:37:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:37:45,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:45,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:45,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:37:45,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:45,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:45,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:45,784 INFO L85 PathProgramCache]: Analyzing trace with hash 696217617, now seen corresponding path program 1 times [2025-03-16 17:37:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:37:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303188361] [2025-03-16 17:37:45,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:45,787 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-03-16 17:37:45,787 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-03-16 17:37:45,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:37:45,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:37:45,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:45,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:45,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:37:45,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:45,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:45,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-16 17:37:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:46,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:37:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:46,080 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:37:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303188361] [2025-03-16 17:37:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303188361] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:37:46,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:37:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2025-03-16 17:37:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984455968] [2025-03-16 17:37:46,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:37:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:37:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:37:46,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:37:46,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:37:46,081 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03-16 17:37:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:48,053 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-03-16 17:37:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 17:37:48,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 15 [2025-03-16 17:37:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:48,053 INFO L225 Difference]: With dead ends: 43 [2025-03-16 17:37:48,053 INFO L226 Difference]: Without dead ends: 39 [2025-03-16 17:37:48,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:37:48,054 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:48,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 17:37:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-16 17:37:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2025-03-16 17:37:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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-03-16 17:37:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-03-16 17:37:48,058 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2025-03-16 17:37:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:48,058 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-16 17:37:48,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-03-16 17:37:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-03-16 17:37:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:37:48,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:48,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:48,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:37:48,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:48,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:48,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash -640936728, now seen corresponding path program 1 times [2025-03-16 17:37:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:37:48,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396524388] [2025-03-16 17:37:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:48,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:37:48,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:37:48,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:37:48,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:37:48,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:48,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:48,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 17:37:48,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:48,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:37:48,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-16 17:37:48,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-16 17:37:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:37:48,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:37:48,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:37:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396524388] [2025-03-16 17:37:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396524388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:37:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878733855] [2025-03-16 17:37:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:48,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:37:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:37:48,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:37:48,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:37:48,462 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:37:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:49,235 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-03-16 17:37:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:37:49,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:37:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:49,236 INFO L225 Difference]: With dead ends: 43 [2025-03-16 17:37:49,236 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:37:49,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:37:49,237 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:49,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 17:37:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:37:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 17:37:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-16 17:37:49,241 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2025-03-16 17:37:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:49,241 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-16 17:37:49,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03-16 17:37:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-16 17:37:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:37:49,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:49,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:49,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:37:49,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:49,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1101873607, now seen corresponding path program 1 times [2025-03-16 17:37:49,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:37:49,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579684696] [2025-03-16 17:37:49,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:49,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:49,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:49,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:37:49,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:37:49,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:37:49,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:37:49,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:49,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:49,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 17:37:49,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:49,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2025-03-16 17:37:49,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2025-03-16 17:37:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:37:49,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:37:49,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:37:49,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579684696] [2025-03-16 17:37:49,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579684696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:37:49,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:37:49,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:37:49,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716967969] [2025-03-16 17:37:49,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:37:49,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:37:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:37:49,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:37:49,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:37:49,707 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03-16 17:37:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:52,113 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2025-03-16 17:37:52,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:37:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03-16 17:37:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:52,114 INFO L225 Difference]: With dead ends: 74 [2025-03-16 17:37:52,114 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 17:37:52,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:37:52,115 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:52,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 84 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 17:37:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 17:37:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2025-03-16 17:37:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-03-16 17:37:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2025-03-16 17:37:52,125 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2025-03-16 17:37:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:52,125 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2025-03-16 17:37:52,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03-16 17:37:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2025-03-16 17:37:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:37:52,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:52,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:52,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 17:37:52,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:52,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:52,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:52,326 INFO L85 PathProgramCache]: Analyzing trace with hash -934339735, now seen corresponding path program 1 times [2025-03-16 17:37:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:37:52,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092521820] [2025-03-16 17:37:52,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:37:52,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:52,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:52,328 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:37:52,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:37:52,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 17:37:52,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:37:52,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:37:52,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:52,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 17:37:52,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:52,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-16 17:37:52,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:37:52,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-16 17:37:52,547 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:37:52,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-16 17:37:52,561 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-03-16 17:37:52,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-16 17:37:52,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-16 17:37:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:52,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:37:52,677 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-16 17:37:52,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 113 [2025-03-16 17:37:52,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:52,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 167 [2025-03-16 17:37:52,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2025-03-16 17:37:52,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-16 17:37:52,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:52,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2025-03-16 17:37:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:53,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:37:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092521820] [2025-03-16 17:37:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092521820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:37:53,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:37:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-16 17:37:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754915928] [2025-03-16 17:37:53,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:37:53,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 17:37:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:37:53,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 17:37:53,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:37:53,144 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:37:56,727 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2025-03-16 17:37:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 17:37:56,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-16 17:37:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:37:56,728 INFO L225 Difference]: With dead ends: 100 [2025-03-16 17:37:56,729 INFO L226 Difference]: Without dead ends: 91 [2025-03-16 17:37:56,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:37:56,730 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 151 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:37:56,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 127 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 17:37:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-16 17:37:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2025-03-16 17:37:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 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-03-16 17:37:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-03-16 17:37:56,741 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 18 [2025-03-16 17:37:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:37:56,742 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-03-16 17:37:56,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:37:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-03-16 17:37:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:37:56,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:37:56,743 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:37:56,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 17:37:56,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:56,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:37:56,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:37:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1129854465, now seen corresponding path program 2 times [2025-03-16 17:37:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 17:37:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1107541352] [2025-03-16 17:37:56,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:37:56,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:37:56,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:37:56,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:37:56,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:37:57,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-16 17:37:57,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:37:57,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:37:57,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:37:57,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-16 17:37:57,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:37:57,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-16 17:37:57,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:37:57,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 106 [2025-03-16 17:37:57,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 78 [2025-03-16 17:37:57,851 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-03-16 17:37:57,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 166 [2025-03-16 17:37:57,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-16 17:37:57,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-16 17:37:57,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2025-03-16 17:37:57,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-16 17:37:57,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 112 [2025-03-16 17:37:57,895 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:37:57,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 100 [2025-03-16 17:37:57,916 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2025-03-16 17:37:57,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 192 [2025-03-16 17:37:57,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 73 [2025-03-16 17:37:57,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 106 [2025-03-16 17:37:57,943 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2025-03-16 17:37:57,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 196 [2025-03-16 17:37:57,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 79 [2025-03-16 17:37:57,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 72 [2025-03-16 17:37:57,978 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2025-03-16 17:37:57,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 142 [2025-03-16 17:37:57,986 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:37:58,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:58,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2025-03-16 17:37:58,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-16 17:37:58,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-16 17:37:58,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2025-03-16 17:37:58,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2025-03-16 17:37:58,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:37:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:37:58,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:37:58,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse0 (select v_ArrVal_293 .cse0))))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_293) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_298) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2025-03-16 17:37:58,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse0 (select v_ArrVal_293 .cse0))))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2025-03-16 17:37:58,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:58,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 93 [2025-03-16 17:37:58,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 559 treesize of output 450 [2025-03-16 17:37:58,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:37:58,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 208 [2025-03-16 17:37:58,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 188 [2025-03-16 17:38:02,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:02,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:03,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:03,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:03,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:04,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:04,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:04,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:04,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:05,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:05,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:05,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:05,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:05,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse19 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)))) (.cse24 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse25 (not .cse8))) (let ((.cse11 (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse114 (store .cse115 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse114 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse114 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse115 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) .cse25)) (.cse16 (or .cse25 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse113 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse113 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse28 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse112 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse112 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse112 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse4 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse35 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse20 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse111 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse110 (store .cse111 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse110 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse110 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse111 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse21 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse108 (store .cse109 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse108 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse108 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse109 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse26 (or .cse8 .cse24)) (.cse18 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse107 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (_ bv1 32) (select (select (store (store .cse107 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))))) (.cse34 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (store .cse105 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse106 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store .cse106 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|)))) (.cse46 (or .cse19 .cse24)) (.cse12 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse103 (store .cse104 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse103 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse103 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse104 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37)))) (.cse13 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse102 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse100 (store .cse102 v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse101 (store .cse100 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse100 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse101 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse101 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse102 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse15 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse98 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse99 (store .cse98 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse98 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse99 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse99 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (.cse14 (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) (.cse27 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse97 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293)) (.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse96 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse97 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse97 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse96 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse30 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse95 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse31 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse32 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse94 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse93 (store .cse94 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse93 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse93 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse94 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse29 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse92 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse92 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse92 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse33 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse91 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse91 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse91 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (.cse10 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))))) (and (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (not (= (store (store (select (store .cse0 v_arrayElimCell_36 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse4 (or (and (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse6 (store .cse7 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse8) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse9 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (or .cse8 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse10) (or (and (or (and .cse11 .cse12 .cse13 .cse14 (or .cse15 .cse8) .cse16 (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8)) .cse10) .cse18 (or .cse19 (and (or (and .cse20 .cse21 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse23 (store .cse22 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store (store .cse22 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse23 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse22 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse23 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) .cse24) .cse25) .cse26)) (or (and .cse27 .cse28 (or .cse29 .cse8) (or .cse8 (and .cse30 .cse31 .cse32 .cse33))) .cse10) .cse34) .cse35) (or (and .cse11 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse36 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse37 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) .cse8) .cse14 .cse16 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse38 (store .cse39 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (let ((.cse40 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse85 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse85 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse85 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse41 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse84 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse84 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse42 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse83 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse82 (store .cse83 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse82 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse83 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse82 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse43 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse81 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse81 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse44 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse45 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse79 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286)) (.cse80 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store .cse79 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse80 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse79 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse80 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse51 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse78 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse52 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse77 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse77 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse77 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse55 (or .cse25 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse76 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse75 (store .cse76 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse75 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse76 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse75 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse49 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse73 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse74 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse73 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))) (.cse50 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse72 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse71 (store .cse72 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse71 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse72 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse71 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse71 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse60 (or .cse25 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse70 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse70 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (.cse48 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse68 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse69 (store .cse68 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse69 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse69 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (and (or (and (or (and .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) .cse10) .cse46 (or .cse10 (and .cse14 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse47 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse48 .cse49 .cse50))) .cse8) .cse18 (or .cse19 (and (or .cse25 (and .cse51 .cse52 .cse24 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse54 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse53 (store (store .cse54 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse53 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse54 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse53 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse54 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) .cse26)) .cse34 (or (and .cse55 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse56 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse56 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse56 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse58 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse57 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse57 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse59 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse14 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) .cse8) .cse60) .cse10) (or (and .cse28 (or .cse40 .cse8) (or (and .cse41 .cse42 .cse43 .cse44) .cse8) .cse45) .cse10) (or (and .cse4 (or (and (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse61 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse61 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse61 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse62 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse62 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38))) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse64 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse63 (store .cse64 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse63 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse64 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse63 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse65 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse65 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (and .cse26 (or .cse25 (and .cse51 .cse52 .cse24 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse66 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse66 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse66 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse66 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))))) .cse19) (or (and .cse55 .cse14 .cse49 (or .cse8 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse67 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse67 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse50 .cse60 (or .cse48 .cse8)) .cse10))) .cse35) (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse86 (store .cse87 v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store .cse87 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse86 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) (or .cse19 (and (or (and .cse20 .cse21 .cse24 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse89 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse88 (store .cse89 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse88 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse89 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse88 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2))))))))) .cse25) .cse26)) (or .cse8 (and .cse18 .cse34 .cse46 (or (and .cse12 .cse13 .cse15 .cse14 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse90 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse90 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) .cse10) (or (and .cse27 .cse30 .cse31 .cse32 .cse29 .cse33) .cse10))))))) is different from false [2025-03-16 17:38:10,070 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (let ((.cse19 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)))) (.cse24 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse25 (not .cse8))) (let ((.cse11 (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse115 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse114 (store .cse115 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse114 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse114 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse115 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) .cse25)) (.cse16 (or .cse25 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse113 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse113 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse113 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse28 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse112 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse112 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse112 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse4 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse35 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse20 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse111 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse110 (store .cse111 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse110 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse110 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse111 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse21 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse108 (store .cse109 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse108 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse108 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse109 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse26 (or .cse8 .cse24)) (.cse18 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse107 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (_ bv1 32) (select (select (store (store .cse107 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))))) (.cse34 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (store .cse105 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse106 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store .cse106 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|)))) (.cse46 (or .cse19 .cse24)) (.cse12 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse103 (store .cse104 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse103 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse103 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse104 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37)))) (.cse13 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse102 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse100 (store .cse102 v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse101 (store .cse100 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse100 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse101 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse101 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse102 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse15 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse98 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse99 (store .cse98 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse98 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse99 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse99 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (.cse14 (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) (.cse27 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse97 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293)) (.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse96 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse97 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse97 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse96 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse30 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse95 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse31 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse32 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse94 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse93 (store .cse94 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse93 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse93 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse94 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse29 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse92 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse92 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse92 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse33 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse91 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse91 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse91 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (.cse10 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))))) (and (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (not (= (store (store (select (store .cse0 v_arrayElimCell_36 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse4 (or (and (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse6 (store .cse7 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse8) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse9 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (or .cse8 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse10) (or (and (or (and .cse11 .cse12 .cse13 .cse14 (or .cse15 .cse8) .cse16 (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8)) .cse10) .cse18 (or .cse19 (and (or (and .cse20 .cse21 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse23 (store .cse22 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store (store .cse22 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse23 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse22 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse23 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) .cse24) .cse25) .cse26)) (or (and .cse27 .cse28 (or .cse29 .cse8) (or .cse8 (and .cse30 .cse31 .cse32 .cse33))) .cse10) .cse34) .cse35) (or (and .cse11 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse36 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse37 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) .cse8) .cse14 .cse16 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse38 (store .cse39 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (let ((.cse40 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse85 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse85 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse85 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse41 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse84 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse84 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse42 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse83 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse82 (store .cse83 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse82 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse83 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse82 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse43 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse81 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse81 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse81 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse44 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse45 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse79 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286)) (.cse80 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store .cse79 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse80 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse79 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse80 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse51 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse78 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse52 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse77 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse77 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse77 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse77 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse55 (or .cse25 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse76 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse75 (store .cse76 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse75 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse76 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse75 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse49 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse74 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse73 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse74 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse73 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))) (.cse50 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse72 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse71 (store .cse72 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse71 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse72 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse71 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse71 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse60 (or .cse25 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse70 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse70 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse70 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (.cse48 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse68 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse69 (store .cse68 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse69 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse69 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (and (or (and (or (and .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) .cse10) .cse46 (or .cse10 (and .cse14 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse47 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse48 .cse49 .cse50))) .cse8) .cse18 (or .cse19 (and (or .cse25 (and .cse51 .cse52 .cse24 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse54 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse53 (store (store .cse54 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse53 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse54 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse53 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse54 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) .cse26)) .cse34 (or (and .cse55 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse56 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse56 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse56 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse58 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse57 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse57 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse59 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse14 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) .cse8) .cse60) .cse10) (or (and .cse28 (or .cse40 .cse8) (or (and .cse41 .cse42 .cse43 .cse44) .cse8) .cse45) .cse10) (or (and .cse4 (or (and (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse61 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse61 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse61 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse62 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse62 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse62 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38))) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse64 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse63 (store .cse64 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse63 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse64 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse63 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse65 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse65 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (and .cse26 (or .cse25 (and .cse51 .cse52 .cse24 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse66 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse66 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse66 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse66 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))))) .cse19) (or (and .cse55 .cse14 .cse49 (or .cse8 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse67 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse67 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse67 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse50 .cse60 (or .cse48 .cse8)) .cse10))) .cse35) (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse86 (store .cse87 v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store .cse87 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse86 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) (or .cse19 (and (or (and .cse20 .cse21 .cse24 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse89 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse88 (store .cse89 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse88 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse89 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse88 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2))))))))) .cse25) .cse26)) (or .cse8 (and .cse18 .cse34 .cse46 (or (and .cse12 .cse13 .cse15 .cse14 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse90 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse90 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse90 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) .cse10) (or (and .cse27 .cse30 .cse31 .cse32 .cse29 .cse33) .cse10))))))) is different from true [2025-03-16 17:38:10,732 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:10,733 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:10,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-03-16 17:38:10,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:38:10,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:38:10,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:38:10,985 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:11,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2025-03-16 17:38:11,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:11,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 53 [2025-03-16 17:38:11,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:11,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2025-03-16 17:38:11,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:38:11,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-03-16 17:38:11,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:38:11,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:11,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:38:12,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:38:12,086 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2025-03-16 17:38:12,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:38:12,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-16 17:38:12,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:12,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:38:12,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:38:12,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-03-16 17:38:12,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:38:12,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-16 17:38:12,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:12,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-16 17:38:12,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:38:12,750 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,751 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:12,752 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,753 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,754 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:12,755 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,756 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:12,757 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,757 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:12,759 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:12,760 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:12,830 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:13,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:13,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 99 [2025-03-16 17:38:13,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-16 17:38:13,674 INFO L224 Elim1Store]: Index analysis took 116 ms [2025-03-16 17:38:16,579 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:38:16,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:38:16,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:17,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:17,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:38:17,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:17,260 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:17,262 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:17,262 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:17,263 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:17,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:17,266 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:17,267 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:17,267 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:17,269 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:17,270 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:17,339 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:17,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:17,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 115 [2025-03-16 17:38:17,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:38:18,067 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:18,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:18,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-03-16 17:38:18,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:38:18,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:19,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:19,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2025-03-16 17:38:19,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:19,685 INFO L224 Elim1Store]: Index analysis took 121 ms [2025-03-16 17:38:21,802 INFO L349 Elim1Store]: treesize reduction 75, result has 21.9 percent of original size [2025-03-16 17:38:21,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 21 [2025-03-16 17:38:22,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:22,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-16 17:38:22,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:22,477 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:22,479 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:22,480 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:22,481 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:22,482 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:22,484 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:22,485 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:22,486 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:22,488 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:22,489 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:22,605 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:22,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:22,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 115 [2025-03-16 17:38:22,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:38:23,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2025-03-16 17:38:23,600 INFO L224 Elim1Store]: Index analysis took 201 ms [2025-03-16 17:38:26,879 INFO L349 Elim1Store]: treesize reduction 41, result has 33.9 percent of original size [2025-03-16 17:38:26,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-03-16 17:38:27,049 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,333 INFO L224 Elim1Store]: Index analysis took 283 ms [2025-03-16 17:38:27,334 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,459 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:38:27,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2025-03-16 17:38:27,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-16 17:38:27,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,708 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:27,709 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,710 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:27,712 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,713 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:27,714 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,715 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:27,718 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:27,720 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-16 17:38:27,793 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:38:28,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:38:28,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 92 [2025-03-16 17:38:28,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:38:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-16 17:38:32,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 17:38:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107541352] [2025-03-16 17:38:32,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107541352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:38:32,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:38:32,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-16 17:38:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894731666] [2025-03-16 17:38:32,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:38:32,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 17:38:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 17:38:32,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 17:38:32,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=9, NotChecked=90, Total=342 [2025-03-16 17:38:32,681 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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-03-16 17:38:39,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (.cse11 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse20 (not (= (_ bv0 1) .cse11))) (.cse25 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse26 (not .cse8))) (let ((.cse12 (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse116 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse115 (store .cse116 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse115 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse115 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse116 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) .cse26)) (.cse17 (or .cse26 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse114 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse114 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse29 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse113 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse113 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse113 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse4 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse36 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse21 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse111 (store .cse112 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse111 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse111 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse112 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse22 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse110 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse109 (store .cse110 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse109 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse109 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse110 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse27 (or .cse8 .cse25)) (.cse19 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse108 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (_ bv1 32) (select (select (store (store .cse108 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))))) (.cse35 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse106 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store .cse106 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse107 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store .cse107 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|)))) (.cse47 (or .cse20 .cse25)) (.cse13 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse104 (store .cse105 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse104 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse104 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse105 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37)))) (.cse14 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse101 (store .cse103 v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse102 (store .cse101 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse101 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse102 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse102 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse103 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse16 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse99 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse100 (store .cse99 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse100 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse100 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (.cse15 (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) (.cse28 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse98 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293)) (.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse97 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse98 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse98 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse97 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse31 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse96 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse96 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse32 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse33 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse94 (store .cse95 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse94 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse94 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse30 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse93 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse93 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse93 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse34 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse92 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse92 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (.cse10 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))))) (and (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (not (= (store (store (select (store .cse0 v_arrayElimCell_36 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (or (and .cse4 (or (and (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse6 (store .cse7 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse8) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse9 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (or .cse8 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse10) (= (_ bv0 1) (bvadd (_ bv1 1) .cse11)) (or (and (or (and .cse12 .cse13 .cse14 .cse15 (or .cse16 .cse8) .cse17 (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8)) .cse10) .cse19 (or .cse20 (and (or (and .cse21 .cse22 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse24 (store .cse23 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store (store .cse23 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse24 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse23 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse24 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) .cse25) .cse26) .cse27)) (or (and .cse28 .cse29 (or .cse30 .cse8) (or .cse8 (and .cse31 .cse32 .cse33 .cse34))) .cse10) .cse35) .cse36) (or (and .cse12 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse37 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse37 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse38 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) .cse8) .cse15 .cse17 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse39 (store .cse40 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse40 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (let ((.cse41 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse86 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse86 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse86 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse42 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse85 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse85 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse85 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse43 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse84 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse83 (store .cse84 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse83 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse83 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse44 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse82 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse82 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse45 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse46 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse80 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286)) (.cse81 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse81 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse81 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse52 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse79 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse79 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse79 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store .cse79 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse53 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse78 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse56 (or .cse26 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse77 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse76 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse77 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse76 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse50 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse74 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse75 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse74 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))) (.cse51 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse73 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse72 (store .cse73 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse72 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse73 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse72 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse72 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse61 (or .cse26 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse71 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse71 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (.cse49 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse69 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse70 (store .cse69 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse69 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse70 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse70 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (and (or (and (or (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) .cse10) .cse47 (or .cse10 (and .cse15 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse48 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse49 .cse50 .cse51))) .cse8) .cse19 (or .cse20 (and (or .cse26 (and .cse52 .cse53 .cse25 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse54 (store (store .cse55 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse54 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse55 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse54 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse55 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) .cse27)) .cse35 (or (and .cse56 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse57 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse57 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse57 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse59 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse58 (store .cse59 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse58 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse58 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse60 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse15 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) .cse8) .cse61) .cse10) (or (and .cse29 (or .cse41 .cse8) (or (and .cse42 .cse43 .cse44 .cse45) .cse8) .cse46) .cse10) (or (and .cse4 (or (and (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse62 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse62 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse62 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse63 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38))) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse65 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse64 (store .cse65 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse64 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse64 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse66 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse66 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (and .cse27 (or .cse26 (and .cse52 .cse53 .cse25 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse67 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse67 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse67 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))))) .cse20) (or (and .cse56 .cse15 .cse50 (or .cse8 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse68 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse51 .cse61 (or .cse49 .cse8)) .cse10))) .cse36) (= (_ bv1 32) (select .cse3 (_ bv8 32))) (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse87 (store .cse88 v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse87 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store .cse88 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse87 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse8 (or .cse20 (and (or (and .cse21 .cse22 .cse25 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse90 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse89 (store .cse90 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse89 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse90 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse89 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2))))))))) .cse26) .cse27)) (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.offset|) (or .cse8 (and .cse19 .cse35 .cse47 (or (and .cse13 .cse14 .cse16 .cse15 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse91 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse91 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) .cse10) (or (and .cse28 .cse31 .cse32 .cse33 .cse30 .cse34) .cse10))))))) is different from false [2025-03-16 17:38:43,611 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (.cse11 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse20 (not (= (_ bv0 1) .cse11))) (.cse25 (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse26 (not .cse8))) (let ((.cse12 (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse116 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse115 (store .cse116 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse115 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse115 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse116 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) .cse26)) (.cse17 (or .cse26 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse114 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse114 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse29 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse113 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse113 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse113 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse4 (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store v_ArrVal_286 |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (.cse36 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse21 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse112 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse111 (store .cse112 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse111 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse111 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse112 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse22 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse110 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse109 (store .cse110 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse109 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse109 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse110 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))) (.cse27 (or .cse8 .cse25)) (.cse19 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse108 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse108 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (_ bv1 32) (select (select (store (store .cse108 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))))) (.cse35 (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse106 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287) v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse106 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse107 (store .cse106 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse107 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store .cse107 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|)))) (.cse47 (or .cse20 .cse25)) (.cse13 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse105 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse104 (store .cse105 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse104 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse104 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse105 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37)))) (.cse14 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse103 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse101 (store .cse103 v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse102 (store .cse101 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse101 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse102 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse102 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse103 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse16 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse99 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (let ((.cse100 (store .cse99 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse100 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse100 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (.cse15 (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) (.cse28 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse98 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293)) (.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse97 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse98 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse98 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse97 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse31 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse96 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse96 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse32 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse33 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse94 (store .cse95 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse94 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse94 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse30 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse93 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse93 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse93 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse34 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse92 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store .cse92 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (.cse10 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))))) (and (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (not (= (store (store (select (store .cse0 v_arrayElimCell_36 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_36) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (or (and .cse4 (or (and (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse6 (store .cse7 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse6 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse8) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse9 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (or .cse8 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse10) (= (_ bv0 1) (bvadd (_ bv1 1) .cse11)) (or (and (or (and .cse12 .cse13 .cse14 .cse15 (or .cse16 .cse8) .cse17 (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8)) .cse10) .cse19 (or .cse20 (and (or (and .cse21 .cse22 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse24 (store .cse23 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store (store .cse23 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse24 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse23 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse24 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) .cse25) .cse26) .cse27)) (or (and .cse28 .cse29 (or .cse30 .cse8) (or .cse8 (and .cse31 .cse32 .cse33 .cse34))) .cse10) .cse35) .cse36) (or (and .cse12 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (or (not (= v_ArrVal_293 (store (store (select (store .cse37 v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse37 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse38 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse38 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) .cse8) .cse15 .cse17 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292))) (let ((.cse39 (store .cse40 v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse39 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse40 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (or (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (let ((.cse41 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse86 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse86 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse86 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse42 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse85 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse85 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse85 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse43 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse84 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse83 (store .cse84 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse83 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse83 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse44 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse82 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse82 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse82 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse45 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse46 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse80 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286)) (.cse81 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store .cse81 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse81 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (.cse52 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse79 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse79 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse79 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (_ bv1 32) (select (select (store (store .cse79 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse53 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse78 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse78 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))) (.cse56 (or .cse26 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse77 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse76 (store .cse77 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse76 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse77 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store .cse76 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (.cse50 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse74 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse75 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse74 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))) (.cse51 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse73 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse72 (store .cse73 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse72 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse73 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse72 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse72 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) (.cse61 (or .cse26 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse71 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse71 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse71 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (.cse49 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse69 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse70 (store .cse69 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (not (= v_ArrVal_293 (store (store (select .cse69 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store .cse70 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse70 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) (and (or (and (or (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) .cse10) .cse47 (or .cse10 (and .cse15 (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse48 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) .cse49 .cse50 .cse51))) .cse8) .cse19 (or .cse20 (and (or .cse26 (and .cse52 .cse53 .cse25 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse55 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse54 (store (store .cse55 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (_ bv1 32) (select (select (store .cse54 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse55 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse54 v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse55 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))) (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) .cse27)) .cse35 (or (and .cse56 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse57 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse57 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store (store .cse57 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse59 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse58 (store .cse59 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse58 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (select (select (store .cse58 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse60 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse15 (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))) .cse8) .cse61) .cse10) (or (and .cse29 (or .cse41 .cse8) (or (and .cse42 .cse43 .cse44 .cse45) .cse8) .cse46) .cse10) (or (and .cse4 (or (and (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse62 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse62 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store (store .cse62 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse63 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))) (forall ((v_arrayElimCell_38 (_ BitVec 32))) (or (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38))) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse65 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (let ((.cse64 (store .cse65 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse64 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (not (= v_ArrVal_293 (store (store (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (select (select (store .cse64 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32))))))) .cse8) (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse66 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= (select (select (store (store .cse66 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (or (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (not (= v_ArrVal_293 (store (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))) .cse8)) .cse10) (or (and .cse27 (or .cse26 (and .cse52 .cse53 .cse25 (forall ((v_arrayElimCell_38 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse67 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (or (= (_ bv1 32) (select (select (store (store (store .cse67 v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select (select (store (store .cse67 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse67 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))))))))))) .cse20) (or (and .cse56 .cse15 .cse50 (or .cse8 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_38 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse68 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_38 v_ArrVal_286))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_38) (not (= v_ArrVal_293 (store (store (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (_ bv1 32) (select (select (store (store .cse68 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) .cse51 .cse61 (or .cse49 .cse8)) .cse10))) .cse36) (= (_ bv1 32) (select .cse3 (_ bv8 32))) (forall ((v_arrayElimCell_36 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_36))) (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse87 (store .cse88 v_arrayElimCell_36 v_ArrVal_286))) (or (not (= (store (store (select .cse87 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)) v_ArrVal_293)) (forall ((v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store .cse88 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_36 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_arrayElimCell_39 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store .cse87 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))))))))) (= v_arrayElimCell_36 |c_ULTIMATE.start_main_~x~0#1.base|))) .cse8 (or .cse20 (and (or (and .cse21 .cse22 .cse25 (forall ((v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= v_ArrVal_287 (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_287 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_39 (_ BitVec 32))) (let ((.cse90 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_287))) (let ((.cse89 (store .cse90 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293))) (or (= (select (select (store .cse89 v_arrayElimCell_37 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= v_ArrVal_293 (store (store (select (store (store .cse90 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1))))) (= (_ bv1 32) (select (select (store .cse89 v_arrayElimCell_39 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= (_ bv1 32) (select v_ArrVal_298 .cse2))))))))) .cse26) .cse27)) (= (_ bv0 32) |c_ULTIMATE.start_main_~x~0#1.offset|) (or .cse8 (and .cse19 .cse35 .cse47 (or (and .cse13 .cse14 .cse16 .cse15 (forall ((v_arrayElimCell_37 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_37) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse91 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_292) v_arrayElimCell_37 v_ArrVal_286))) (or (not (= v_ArrVal_293 (store (store (select .cse91 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| (select v_ArrVal_293 |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse1 (select v_ArrVal_293 .cse1)))) (= (select (select (store (store .cse91 |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_293) v_arrayElimCell_35 v_ArrVal_298) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (_ bv1 32)))))))) .cse10) (or (and .cse28 .cse31 .cse32 .cse33 .cse30 .cse34) .cse10))))))) is different from true