/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-fpi/sina2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 21:08:13,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 21:08:13,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 21:08:13,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 21:08:13,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 21:08:13,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 21:08:13,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 21:08:13,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 21:08:13,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 21:08:13,933 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 21:08:13,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 21:08:13,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 21:08:13,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 21:08:13,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 21:08:13,935 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 21:08:13,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 21:08:13,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 21:08:13,936 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 21:08:13,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 21:08:13,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 21:08:13,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 21:08:13,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 21:08:13,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 21:08:13,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 21:08:13,938 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 21:08:13,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 21:08:13,938 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 21:08:13,938 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 21:08:13,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 21:08:13,939 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 21:08:13,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 21:08:13,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 21:08:13,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 21:08:13,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 21:08:13,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:08:13,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 21:08:13,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 21:08:13,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 21:08:13,941 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 21:08:13,941 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 21:08:13,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 21:08:13,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 21:08:13,941 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 21:08:13,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 21:08:13,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 21:08:13,942 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 21:08:13,942 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 21:08:14,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 21:08:14,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 21:08:14,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 21:08:14,162 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 21:08:14,162 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 21:08:14,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina2.c [2023-12-21 21:08:15,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 21:08:15,455 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 21:08:15,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina2.c [2023-12-21 21:08:15,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654d33d8c/126c0102cddd4e6eb73fe99379ff345b/FLAG018c0c43c [2023-12-21 21:08:15,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654d33d8c/126c0102cddd4e6eb73fe99379ff345b [2023-12-21 21:08:15,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 21:08:15,477 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 21:08:15,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 21:08:15,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 21:08:15,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 21:08:15,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d92b123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15, skipping insertion in model container [2023-12-21 21:08:15,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 21:08:15,608 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina2.c[588,601] [2023-12-21 21:08:15,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:08:15,637 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 21:08:15,649 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina2.c[588,601] [2023-12-21 21:08:15,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:08:15,673 INFO L206 MainTranslator]: Completed translation [2023-12-21 21:08:15,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15 WrapperNode [2023-12-21 21:08:15,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 21:08:15,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 21:08:15,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 21:08:15,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 21:08:15,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,703 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2023-12-21 21:08:15,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 21:08:15,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 21:08:15,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 21:08:15,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 21:08:15,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,734 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 4, 8, 5]. 42 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0]. The 4 writes are split as follows [0, 2, 0, 2]. [2023-12-21 21:08:15,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 21:08:15,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 21:08:15,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 21:08:15,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 21:08:15,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (1/1) ... [2023-12-21 21:08:15,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:08:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 21:08:15,783 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) [2023-12-21 21:08:15,794 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 [2023-12-21 21:08:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 21:08:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 21:08:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 21:08:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 21:08:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 21:08:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 21:08:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 21:08:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 21:08:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 21:08:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 21:08:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 21:08:15,923 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 21:08:15,925 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 21:08:16,167 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 21:08:16,206 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 21:08:16,207 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 21:08:16,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:08:16 BoogieIcfgContainer [2023-12-21 21:08:16,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 21:08:16,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 21:08:16,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 21:08:16,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 21:08:16,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 09:08:15" (1/3) ... [2023-12-21 21:08:16,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a1562d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:08:16, skipping insertion in model container [2023-12-21 21:08:16,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:08:15" (2/3) ... [2023-12-21 21:08:16,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a1562d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:08:16, skipping insertion in model container [2023-12-21 21:08:16,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:08:16" (3/3) ... [2023-12-21 21:08:16,228 INFO L112 eAbstractionObserver]: Analyzing ICFG sina2.c [2023-12-21 21:08:16,245 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 21:08:16,245 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 21:08:16,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 21:08:16,304 INFO L357 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, mHoare=true, 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;@6133b65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 21:08:16,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 21:08:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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) [2023-12-21 21:08:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 21:08:16,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:08:16,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:08:16,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:08:16,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:08:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash -895324270, now seen corresponding path program 1 times [2023-12-21 21:08:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:08:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138365828] [2023-12-21 21:08:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:08:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:08:16,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:08:16,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 21:08:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:08:16,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 21:08:16,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:08:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:08:16,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:08:16,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:08:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138365828] [2023-12-21 21:08:16,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138365828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:08:16,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:08:16,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 21:08:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906057847] [2023-12-21 21:08:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:08:16,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 21:08:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:08:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 21:08:16,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 21:08:16,548 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:08:16,595 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2023-12-21 21:08:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 21:08:16,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 21:08:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:08:16,603 INFO L225 Difference]: With dead ends: 33 [2023-12-21 21:08:16,603 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 21:08:16,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 21:08:16,612 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:08:16,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 21:08:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 21:08:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 21:08:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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) [2023-12-21 21:08:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 21:08:16,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2023-12-21 21:08:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:08:16,648 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 21:08:16,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 21:08:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 21:08:16,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:08:16,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:08:16,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 21:08:16,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:16,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:08:16,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:08:16,854 INFO L85 PathProgramCache]: Analyzing trace with hash -194259692, now seen corresponding path program 1 times [2023-12-21 21:08:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:08:16,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880953856] [2023-12-21 21:08:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:08:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:08:16,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:08:16,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 21:08:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:08:16,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 21:08:16,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:08:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:08:17,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:08:17,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:08:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880953856] [2023-12-21 21:08:17,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880953856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:08:17,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:08:17,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 21:08:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456201152] [2023-12-21 21:08:17,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:08:17,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 21:08:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:08:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 21:08:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 21:08:17,057 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:08:17,148 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-12-21 21:08:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 21:08:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 21:08:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:08:17,150 INFO L225 Difference]: With dead ends: 33 [2023-12-21 21:08:17,150 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 21:08:17,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 21:08:17,151 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:08:17,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:08:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 21:08:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2023-12-21 21:08:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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) [2023-12-21 21:08:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-21 21:08:17,157 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-12-21 21:08:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:08:17,157 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-21 21:08:17,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-21 21:08:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 21:08:17,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:08:17,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:08:17,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 21:08:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:17,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:08:17,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:08:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash -925805478, now seen corresponding path program 1 times [2023-12-21 21:08:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:08:17,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355014227] [2023-12-21 21:08:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:08:17,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:17,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:08:17,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:08:17,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 21:08:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:08:17,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 21:08:17,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:08:17,588 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:08:17,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 21:08:17,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:08:17,681 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 16 treesize of output 17 [2023-12-21 21:08:17,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:17,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-12-21 21:08:18,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:18,161 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 109 treesize of output 85 [2023-12-21 21:08:18,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:18,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 73 [2023-12-21 21:08:18,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:18,319 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 119 treesize of output 95 [2023-12-21 21:08:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:08:18,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:08:19,546 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 354 treesize of output 330 [2023-12-21 21:08:19,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:19,596 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 1946 treesize of output 1802 [2023-12-21 21:08:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:08:21,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:08:21,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355014227] [2023-12-21 21:08:21,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355014227] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:08:21,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:08:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-21 21:08:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075579475] [2023-12-21 21:08:21,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:08:21,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 21:08:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:08:21,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 21:08:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-12-21 21:08:21,294 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:24,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 21:08:28,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 21:08:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:08:31,202 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2023-12-21 21:08:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 21:08:31,202 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-21 21:08:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:08:31,203 INFO L225 Difference]: With dead ends: 44 [2023-12-21 21:08:31,203 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 21:08:31,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 21:08:31,204 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-12-21 21:08:31,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 86 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2023-12-21 21:08:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 21:08:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2023-12-21 21:08:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-12-21 21:08:31,212 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2023-12-21 21:08:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:08:31,213 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-12-21 21:08:31,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-12-21 21:08:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 21:08:31,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:08:31,213 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:08:31,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 21:08:31,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:31,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:08:31,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:08:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2031512559, now seen corresponding path program 2 times [2023-12-21 21:08:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:08:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902998811] [2023-12-21 21:08:31,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:08:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:31,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:08:31,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:08:31,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 21:08:31,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:08:31,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:08:31,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 21:08:31,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:08:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:08:31,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:08:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:08:31,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:08:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902998811] [2023-12-21 21:08:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902998811] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:08:31,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:08:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 21:08:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091189368] [2023-12-21 21:08:31,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:08:31,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 21:08:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:08:31,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 21:08:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-21 21:08:31,737 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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) [2023-12-21 21:08:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:08:32,046 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2023-12-21 21:08:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 21:08:32,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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 [2023-12-21 21:08:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:08:32,047 INFO L225 Difference]: With dead ends: 64 [2023-12-21 21:08:32,047 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 21:08:32,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-21 21:08:32,048 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:08:32,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 67 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:08:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 21:08:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2023-12-21 21:08:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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) [2023-12-21 21:08:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-12-21 21:08:32,055 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2023-12-21 21:08:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:08:32,055 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-12-21 21:08:32,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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) [2023-12-21 21:08:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-12-21 21:08:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 21:08:32,069 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:08:32,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:08:32,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 21:08:32,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:32,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:08:32,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:08:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2030966525, now seen corresponding path program 3 times [2023-12-21 21:08:32,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:08:32,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106880839] [2023-12-21 21:08:32,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:08:32,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:32,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:08:32,275 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:08:32,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 21:08:32,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 21:08:32,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:08:32,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 21:08:32,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:08:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:08:32,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:08:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:08:32,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:08:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106880839] [2023-12-21 21:08:32,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106880839] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:08:32,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:08:32,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-21 21:08:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067507657] [2023-12-21 21:08:32,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:08:32,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 21:08:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:08:32,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 21:08:32,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-21 21:08:32,639 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) [2023-12-21 21:08:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:08:33,002 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2023-12-21 21:08:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 21:08:33,003 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 [2023-12-21 21:08:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:08:33,004 INFO L225 Difference]: With dead ends: 76 [2023-12-21 21:08:33,004 INFO L226 Difference]: Without dead ends: 57 [2023-12-21 21:08:33,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-12-21 21:08:33,005 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 142 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:08:33,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 64 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:08:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-21 21:08:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2023-12-21 21:08:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-12-21 21:08:33,014 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2023-12-21 21:08:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:08:33,014 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-12-21 21:08:33,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) [2023-12-21 21:08:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-12-21 21:08:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 21:08:33,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:08:33,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:08:33,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 21:08:33,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:33,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:08:33,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:08:33,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1382312724, now seen corresponding path program 4 times [2023-12-21 21:08:33,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:08:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241072260] [2023-12-21 21:08:33,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:08:33,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:08:33,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:08:33,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:08:33,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 21:08:33,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:08:33,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:08:33,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 21:08:33,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:08:33,373 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:08:33,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 21:08:33,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:08:33,419 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 16 treesize of output 17 [2023-12-21 21:08:33,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:08:33,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:33,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2023-12-21 21:08:33,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:33,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-12-21 21:08:33,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:33,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 85 [2023-12-21 21:08:34,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:34,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 139 [2023-12-21 21:08:34,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:34,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 213 treesize of output 179 [2023-12-21 21:08:34,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:34,272 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 173 treesize of output 133 [2023-12-21 21:08:34,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:34,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 355 treesize of output 323 [2023-12-21 21:08:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:08:34,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:08:37,761 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 1314 treesize of output 1258 [2023-12-21 21:08:38,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:08:38,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 973140014 treesize of output 949022766 [2023-12-21 21:08:52,390 WARN L876 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse9 ((_ extract 63 32) (_ bv1 64))) (.cse16 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse23 (concat .cse9 .cse16)) (.cse7 (let ((.cse480 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse480 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse480 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (.cse478 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse104 (= (_ bv8 32) .cse478)) (.cse216 (let ((.cse479 (bvadd .cse23 .cse7))) (concat ((_ extract 63 32) .cse479) ((_ extract 31 0) .cse479)))) (.cse14 (concat .cse16 .cse9)) (.cse463 (= .cse478 (_ bv0 32))) (.cse10 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv1 32))))) (let ((.cse212 (= (bvadd (_ bv8 32) .cse478) (_ bv0 32))) (.cse1 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= (let ((.cse474 (let ((.cse477 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse475 (bvadd (let ((.cse476 (bvadd .cse7 .cse477))) (concat ((_ extract 63 32) .cse476) ((_ extract 31 0) .cse476))) .cse23))) (concat ((_ extract 63 32) .cse475) ((_ extract 31 0) .cse475))) .cse477)))) (concat ((_ extract 63 32) .cse474) ((_ extract 31 0) .cse474))) .cse10))) (.cse185 (not .cse463)) (.cse148 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse466 (let ((.cse467 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse467 (let ((.cse468 (bvadd .cse14 (let ((.cse469 (bvadd .cse467 .cse7))) (concat ((_ extract 63 32) .cse469) ((_ extract 31 0) .cse469)))))) (concat ((_ extract 63 32) .cse468) ((_ extract 31 0) .cse468))))))) (concat ((_ extract 63 32) .cse466) ((_ extract 31 0) .cse466))) .cse10) (= (let ((.cse470 (let ((.cse473 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse471 (bvadd (let ((.cse472 (bvadd .cse7 .cse473))) (concat ((_ extract 63 32) .cse472) ((_ extract 31 0) .cse472))) .cse23))) (concat ((_ extract 63 32) .cse471) ((_ extract 31 0) .cse471))) .cse473)))) (concat ((_ extract 63 32) .cse470) ((_ extract 31 0) .cse470))) .cse10)))) (.cse213 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse464 (bvadd (let ((.cse465 (bvadd .cse216 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))) .cse23))) (concat ((_ extract 63 32) .cse464) ((_ extract 31 0) .cse464))) .cse10))) (.cse2 (not .cse104)) (.cse0 (and (= (let ((.cse461 (bvadd .cse23 (let ((.cse462 (bvadd .cse216 .cse23))) (concat ((_ extract 63 32) .cse462) ((_ extract 31 0) .cse462)))))) (concat ((_ extract 63 32) .cse461) ((_ extract 31 0) .cse461))) .cse10) .cse463))) (and (or .cse0 (and (or .cse1 .cse2) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse8 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse3 (let ((.cse4 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse4 (let ((.cse5 (bvadd (let ((.cse6 (bvadd .cse7 .cse4))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))) .cse8))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5))))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse20 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse19 (let ((.cse24 (bvadd .cse7 .cse20))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))))) (or (= (let ((.cse11 (let ((.cse12 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse12 (let ((.cse13 (bvadd .cse14 (let ((.cse15 (bvadd .cse12 .cse7))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15)))))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))))))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))) .cse10) (= .cse10 (let ((.cse17 (bvadd (let ((.cse18 (bvadd .cse19 .cse8))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))) .cse20))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17)))) (= (let ((.cse21 (bvadd (let ((.cse22 (bvadd .cse19 .cse23))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse20))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))) .cse10)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse32 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse31 (let ((.cse35 (bvadd .cse7 .cse32))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))))) (or (= (let ((.cse25 (let ((.cse26 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse26 (let ((.cse27 (bvadd .cse14 (let ((.cse28 (bvadd .cse26 .cse7))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28)))))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))))))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse10) (= .cse10 (let ((.cse29 (bvadd (let ((.cse30 (bvadd .cse31 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30))) .cse32))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))) (= (let ((.cse33 (bvadd (let ((.cse34 (bvadd .cse31 .cse23))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34))) .cse32))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) .cse10))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse43 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse44 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse42 (let ((.cse49 (bvadd .cse7 .cse44))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))))) (or (= (let ((.cse36 (let ((.cse37 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse37 (let ((.cse38 (bvadd .cse14 (let ((.cse39 (bvadd .cse37 .cse7))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39)))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38))))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse10) (= .cse10 (let ((.cse40 (bvadd (let ((.cse41 (bvadd .cse42 .cse43))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))) .cse44))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))) (= (let ((.cse45 (bvadd (let ((.cse46 (bvadd .cse42 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))) .cse44))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))) .cse10) (= (let ((.cse47 (bvadd (let ((.cse48 (bvadd .cse42 .cse23))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse44))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse10))))) (= (let ((.cse50 (let ((.cse51 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse51 (let ((.cse52 (bvadd (let ((.cse53 (bvadd .cse7 .cse51))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse43))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))) .cse10)))) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse58 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (= .cse10 (let ((.cse54 (let ((.cse57 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse55 (bvadd (let ((.cse56 (bvadd .cse7 .cse57))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse58))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse57)))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))))) (= (let ((.cse59 (let ((.cse60 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse60 (let ((.cse61 (bvadd (let ((.cse62 (bvadd .cse7 .cse60))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))) .cse58))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))))))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse10)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse67 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse63 (let ((.cse64 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse64 (let ((.cse65 (bvadd (let ((.cse66 (bvadd .cse7 .cse64))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))) .cse67))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse75 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse74 (let ((.cse78 (bvadd .cse7 .cse75))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))))) (or (= (let ((.cse68 (let ((.cse69 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse69 (let ((.cse70 (bvadd .cse14 (let ((.cse71 (bvadd .cse69 .cse7))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71)))))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))))))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68))) .cse10) (= .cse10 (let ((.cse72 (bvadd (let ((.cse73 (bvadd .cse74 .cse67))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse75))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72)))) (= (let ((.cse76 (bvadd (let ((.cse77 (bvadd .cse74 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))) .cse75))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse10)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse83 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse79 (let ((.cse80 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse80 (let ((.cse81 (bvadd (let ((.cse82 (bvadd .cse7 .cse80))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse83))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse87 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse86 (let ((.cse90 (bvadd .cse7 .cse87))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))))) (or (= .cse10 (let ((.cse84 (bvadd (let ((.cse85 (bvadd .cse86 .cse83))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85))) .cse87))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84)))) (= (let ((.cse88 (bvadd (let ((.cse89 (bvadd .cse86 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) .cse87))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse10)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse95 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse91 (let ((.cse92 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse92 (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse7 .cse92))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse95))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))))))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse96 (let ((.cse97 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse97 (let ((.cse98 (bvadd .cse14 (let ((.cse99 (bvadd .cse97 .cse7))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99)))))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))))))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))) .cse10) (= .cse10 (let ((.cse100 (let ((.cse103 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse101 (bvadd (let ((.cse102 (bvadd .cse7 .cse103))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) .cse95))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))) .cse103)))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100)))))))))) .cse104) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= .cse10 (let ((.cse105 (let ((.cse108 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse106 (bvadd (let ((.cse107 (bvadd .cse7 .cse108))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106))) .cse108)))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse112 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse111 (let ((.cse115 (bvadd .cse7 .cse112))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))))) (or (= .cse10 (let ((.cse109 (bvadd (let ((.cse110 (bvadd .cse111 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110))) .cse112))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109)))) (= (let ((.cse113 (bvadd (let ((.cse114 (bvadd .cse111 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse112))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113))) .cse10))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse116 (let ((.cse117 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse117 (let ((.cse118 (bvadd .cse14 (let ((.cse119 (bvadd .cse117 .cse7))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119)))))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))))))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse10) (= .cse10 (let ((.cse120 (let ((.cse123 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse121 (bvadd (let ((.cse122 (bvadd .cse7 .cse123))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121))) .cse123)))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120)))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse131 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse130 (let ((.cse134 (bvadd .cse7 .cse131))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))))) (or (= (let ((.cse124 (let ((.cse125 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse125 (let ((.cse126 (bvadd .cse14 (let ((.cse127 (bvadd .cse125 .cse7))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127)))))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))))))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse10) (= .cse10 (let ((.cse128 (bvadd (let ((.cse129 (bvadd .cse130 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse131))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))) (= (let ((.cse132 (bvadd (let ((.cse133 (bvadd .cse130 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse131))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse10)))))) .cse104) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse142 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse141 (let ((.cse147 (bvadd .cse7 .cse142))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147))))) (or (= (let ((.cse135 (let ((.cse136 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse136 (let ((.cse137 (bvadd .cse14 (let ((.cse138 (bvadd .cse136 .cse7))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138)))))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))))))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse10) (= .cse10 (let ((.cse139 (bvadd (let ((.cse140 (bvadd .cse141 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140))) .cse142))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139)))) (= (let ((.cse143 (bvadd (let ((.cse144 (bvadd .cse141 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) .cse142))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse10) (= (let ((.cse145 (bvadd (let ((.cse146 (bvadd .cse141 .cse23))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146))) .cse142))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse10))))) (or .cse148 .cse2) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse152 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse151 (let ((.cse157 (bvadd .cse7 .cse152))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))))) (or (= .cse10 (let ((.cse149 (bvadd (let ((.cse150 (bvadd .cse151 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150))) .cse152))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))) (= (let ((.cse153 (bvadd (let ((.cse154 (bvadd .cse151 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) .cse152))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153))) .cse10) (= (let ((.cse155 (bvadd (let ((.cse156 (bvadd .cse151 .cse23))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse152))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse10))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse161 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse160 (let ((.cse164 (bvadd .cse7 .cse161))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))))) (or (= .cse10 (let ((.cse158 (bvadd (let ((.cse159 (bvadd .cse160 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159))) .cse161))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158)))) (= (let ((.cse162 (bvadd (let ((.cse163 (bvadd .cse160 .cse23))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse161))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162))) .cse10))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse165 (let ((.cse166 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse166 (let ((.cse167 (bvadd (let ((.cse168 (bvadd .cse7 .cse166))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))))))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165))) .cse10) (= (let ((.cse169 (let ((.cse172 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse170 (bvadd (let ((.cse171 (bvadd .cse7 .cse172))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))) .cse23))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse172)))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))) .cse10))) .cse2) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse177 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse173 (let ((.cse174 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse174 (let ((.cse175 (bvadd (let ((.cse176 (bvadd .cse7 .cse174))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse177))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))))))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse181 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse180 (let ((.cse184 (bvadd .cse7 .cse181))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))))) (or (= .cse10 (let ((.cse178 (bvadd (let ((.cse179 (bvadd .cse180 .cse177))) (concat ((_ extract 63 32) .cse179) ((_ extract 31 0) .cse179))) .cse181))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178)))) (= (let ((.cse182 (bvadd (let ((.cse183 (bvadd .cse180 .cse23))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183))) .cse181))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))) .cse10)))))))) .cse185 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse190 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse186 (let ((.cse187 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse187 (let ((.cse188 (bvadd (let ((.cse189 (bvadd .cse7 .cse187))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))) .cse190))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188))))))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse194 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse193 (let ((.cse199 (bvadd .cse7 .cse194))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))))) (or (= .cse10 (let ((.cse191 (bvadd (let ((.cse192 (bvadd .cse193 .cse190))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))) .cse194))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191)))) (= (let ((.cse195 (bvadd (let ((.cse196 (bvadd .cse193 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse194))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse10) (= (let ((.cse197 (bvadd (let ((.cse198 (bvadd .cse193 .cse23))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse194))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) .cse10)))))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse200 (let ((.cse201 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse201 (let ((.cse202 (bvadd (let ((.cse203 (bvadd .cse7 .cse201))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202))))))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse10) (= (let ((.cse204 (let ((.cse205 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse205 (let ((.cse206 (bvadd .cse14 (let ((.cse207 (bvadd .cse205 .cse7))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))))))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204))) .cse10) (= (let ((.cse208 (let ((.cse211 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse209 (bvadd (let ((.cse210 (bvadd .cse7 .cse211))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse23))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse211)))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse10))) .cse2)) .cse212) (or (not .cse212) .cse213) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse217 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse214 (bvadd (let ((.cse215 (bvadd .cse216 .cse217))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215))) .cse23))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse221 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse220 (let ((.cse224 (bvadd .cse7 .cse221))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))))) (or (= .cse10 (let ((.cse218 (bvadd (let ((.cse219 (bvadd .cse220 .cse217))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse221))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218)))) (= (let ((.cse222 (bvadd (let ((.cse223 (bvadd .cse220 .cse23))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse221))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222))) .cse10)))))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse227 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse225 (bvadd (let ((.cse226 (bvadd .cse216 .cse227))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse23))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))) .cse10) (= (let ((.cse228 (let ((.cse229 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse229 (let ((.cse230 (bvadd (let ((.cse231 (bvadd .cse7 .cse229))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse227))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))))))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228))) .cse10) (= (let ((.cse232 (let ((.cse235 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse233 (bvadd (let ((.cse234 (bvadd .cse7 .cse235))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234))) .cse23))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))) .cse235)))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232))) .cse10)))) .cse2) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse244 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse236 (let ((.cse237 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse237 (let ((.cse238 (bvadd .cse14 (let ((.cse239 (bvadd .cse237 .cse7))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239)))))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238))))))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse10) (= .cse10 (let ((.cse240 (let ((.cse243 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse241 (bvadd (let ((.cse242 (bvadd .cse7 .cse243))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse244))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse243)))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240)))))) (= (let ((.cse245 (bvadd (let ((.cse246 (bvadd .cse216 .cse244))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) .cse23))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))) .cse10)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse251 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= .cse10 (let ((.cse247 (let ((.cse250 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse248 (bvadd (let ((.cse249 (bvadd .cse7 .cse250))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse251))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse250)))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))))) (= (let ((.cse252 (bvadd (let ((.cse253 (bvadd .cse216 .cse251))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse23))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse10)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse256 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse254 (bvadd (let ((.cse255 (bvadd .cse216 .cse256))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse23))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse260 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse259 (let ((.cse263 (bvadd .cse7 .cse260))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))))) (or (= .cse10 (let ((.cse257 (bvadd (let ((.cse258 (bvadd .cse259 .cse256))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258))) .cse260))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257)))) (= (let ((.cse261 (bvadd (let ((.cse262 (bvadd .cse259 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) .cse260))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261))) .cse10)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse266 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse264 (bvadd (let ((.cse265 (bvadd .cse216 .cse266))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))) .cse23))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse274 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse273 (let ((.cse277 (bvadd .cse7 .cse274))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))))) (or (= (let ((.cse267 (let ((.cse268 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse268 (let ((.cse269 (bvadd .cse14 (let ((.cse270 (bvadd .cse268 .cse7))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270)))))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))))))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267))) .cse10) (= .cse10 (let ((.cse271 (bvadd (let ((.cse272 (bvadd .cse273 .cse266))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272))) .cse274))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271)))) (= (let ((.cse275 (bvadd (let ((.cse276 (bvadd .cse273 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse274))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse10))))))))) .cse104) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse280 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse278 (bvadd (let ((.cse279 (bvadd .cse216 .cse280))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) .cse23))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse281 (let ((.cse282 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse282 (let ((.cse283 (bvadd (let ((.cse284 (bvadd .cse7 .cse282))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284))) .cse280))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283))))))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse292 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse291 (let ((.cse295 (bvadd .cse7 .cse292))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))))) (or (= (let ((.cse285 (let ((.cse286 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse286 (let ((.cse287 (bvadd .cse14 (let ((.cse288 (bvadd .cse286 .cse7))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))))))) (concat ((_ extract 63 32) .cse285) ((_ extract 31 0) .cse285))) .cse10) (= .cse10 (let ((.cse289 (bvadd (let ((.cse290 (bvadd .cse291 .cse280))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse292))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289)))) (= (let ((.cse293 (bvadd (let ((.cse294 (bvadd .cse291 .cse23))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294))) .cse292))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))) .cse10)))))))))) (or .cse1 .cse213 .cse2) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse298 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse296 (bvadd (let ((.cse297 (bvadd .cse216 .cse298))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse23))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse306 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse305 (let ((.cse309 (bvadd .cse7 .cse306))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))))) (or (= (let ((.cse299 (let ((.cse300 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse300 (let ((.cse301 (bvadd .cse14 (let ((.cse302 (bvadd .cse300 .cse7))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))))))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse10) (= .cse10 (let ((.cse303 (bvadd (let ((.cse304 (bvadd .cse305 .cse298))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304))) .cse306))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303)))) (= (let ((.cse307 (bvadd (let ((.cse308 (bvadd .cse305 .cse23))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))) .cse306))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307))) .cse10)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse312 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse310 (bvadd (let ((.cse311 (bvadd .cse216 .cse312))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse23))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse316 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse315 (let ((.cse321 (bvadd .cse7 .cse316))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321))))) (or (= .cse10 (let ((.cse313 (bvadd (let ((.cse314 (bvadd .cse315 .cse312))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314))) .cse316))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))) (= (let ((.cse317 (bvadd (let ((.cse318 (bvadd .cse315 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse316))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317))) .cse10) (= (let ((.cse319 (bvadd (let ((.cse320 (bvadd .cse315 .cse23))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320))) .cse316))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))) .cse10)))))))) (or .cse185 .cse213) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse324 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse322 (bvadd (let ((.cse323 (bvadd .cse216 .cse324))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) .cse23))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (= .cse10 (let ((.cse325 (let ((.cse328 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse326 (bvadd (let ((.cse327 (bvadd .cse7 .cse328))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse324))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))) .cse328)))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))))) (= (let ((.cse329 (let ((.cse330 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse330 (let ((.cse331 (bvadd (let ((.cse332 (bvadd .cse7 .cse330))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))) .cse324))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))))))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse10)))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse335 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse333 (bvadd (let ((.cse334 (bvadd .cse216 .cse335))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) .cse23))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse336 (let ((.cse337 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse337 (let ((.cse338 (bvadd (let ((.cse339 (bvadd .cse7 .cse337))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))) .cse335))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))))))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse340 (let ((.cse341 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse341 (let ((.cse342 (bvadd .cse14 (let ((.cse343 (bvadd .cse341 .cse7))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343)))))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))))))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) .cse10) (= .cse10 (let ((.cse344 (let ((.cse347 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse345 (bvadd (let ((.cse346 (bvadd .cse7 .cse347))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse335))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))) .cse347)))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))))))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse350 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse348 (bvadd (let ((.cse349 (bvadd .cse216 .cse350))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349))) .cse23))) (concat ((_ extract 63 32) .cse348) ((_ extract 31 0) .cse348))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse351 (let ((.cse352 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse352 (let ((.cse353 (bvadd (let ((.cse354 (bvadd .cse7 .cse352))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354))) .cse350))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))))))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse362 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse361 (let ((.cse365 (bvadd .cse7 .cse362))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))))) (or (= (let ((.cse355 (let ((.cse356 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse356 (let ((.cse357 (bvadd .cse14 (let ((.cse358 (bvadd .cse356 .cse7))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358)))))) (concat ((_ extract 63 32) .cse357) ((_ extract 31 0) .cse357))))))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))) .cse10) (= .cse10 (let ((.cse359 (bvadd (let ((.cse360 (bvadd .cse361 .cse350))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))) .cse362))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359)))) (= (let ((.cse363 (bvadd (let ((.cse364 (bvadd .cse361 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse362))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))) .cse10)))))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse370 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse366 (let ((.cse367 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse367 (let ((.cse368 (bvadd (let ((.cse369 (bvadd .cse7 .cse367))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))) .cse370))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))))))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse374 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse373 (let ((.cse377 (bvadd .cse7 .cse374))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377))))) (or (= .cse10 (let ((.cse371 (bvadd (let ((.cse372 (bvadd .cse373 .cse370))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse374))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371)))) (= (let ((.cse375 (bvadd (let ((.cse376 (bvadd .cse373 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse374))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375))) .cse10))))))) (= (let ((.cse378 (bvadd (let ((.cse379 (bvadd .cse216 .cse370))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))) .cse23))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))) .cse10))))) .cse104) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse382 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse380 (bvadd (let ((.cse381 (bvadd .cse216 .cse382))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse23))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))) .cse10) (= (let ((.cse383 (let ((.cse384 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse384 (let ((.cse385 (bvadd (let ((.cse386 (bvadd .cse7 .cse384))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386))) .cse382))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385))))))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383))) .cse10) (= (let ((.cse387 (let ((.cse388 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse388 (let ((.cse389 (bvadd .cse14 (let ((.cse390 (bvadd .cse388 .cse7))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390)))))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389))))))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse10) (= (let ((.cse391 (let ((.cse394 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse392 (bvadd (let ((.cse393 (bvadd .cse7 .cse394))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393))) .cse23))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse394)))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391))) .cse10)))) .cse2) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse397 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse395 (bvadd (let ((.cse396 (bvadd .cse216 .cse397))) (concat ((_ extract 63 32) .cse396) ((_ extract 31 0) .cse396))) .cse23))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse398 (let ((.cse399 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse399 (let ((.cse400 (bvadd (let ((.cse401 (bvadd .cse7 .cse399))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401))) .cse397))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))))))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse405 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse404 (let ((.cse410 (bvadd .cse7 .cse405))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))))) (or (= .cse10 (let ((.cse402 (bvadd (let ((.cse403 (bvadd .cse404 .cse397))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403))) .cse405))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402)))) (= (let ((.cse406 (bvadd (let ((.cse407 (bvadd .cse404 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407))) .cse405))) (concat ((_ extract 63 32) .cse406) ((_ extract 31 0) .cse406))) .cse10) (= (let ((.cse408 (bvadd (let ((.cse409 (bvadd .cse404 .cse23))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse405))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408))) .cse10)))))))))) (or .cse148 .cse213 .cse2) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse418 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse419 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse417 (let ((.cse424 (bvadd .cse7 .cse419))) (concat ((_ extract 63 32) .cse424) ((_ extract 31 0) .cse424))))) (or (= (let ((.cse411 (let ((.cse412 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse412 (let ((.cse413 (bvadd .cse14 (let ((.cse414 (bvadd .cse412 .cse7))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414)))))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413))))))) (concat ((_ extract 63 32) .cse411) ((_ extract 31 0) .cse411))) .cse10) (= .cse10 (let ((.cse415 (bvadd (let ((.cse416 (bvadd .cse417 .cse418))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416))) .cse419))) (concat ((_ extract 63 32) .cse415) ((_ extract 31 0) .cse415)))) (= (let ((.cse420 (bvadd (let ((.cse421 (bvadd .cse417 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421))) .cse419))) (concat ((_ extract 63 32) .cse420) ((_ extract 31 0) .cse420))) .cse10) (= (let ((.cse422 (bvadd (let ((.cse423 (bvadd .cse417 .cse23))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))) .cse419))) (concat ((_ extract 63 32) .cse422) ((_ extract 31 0) .cse422))) .cse10))))) (= (let ((.cse425 (bvadd (let ((.cse426 (bvadd .cse216 .cse418))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426))) .cse23))) (concat ((_ extract 63 32) .cse425) ((_ extract 31 0) .cse425))) .cse10)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse429 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse427 (bvadd (let ((.cse428 (bvadd .cse216 .cse429))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428))) .cse23))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse430 (let ((.cse431 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse431 (let ((.cse432 (bvadd (let ((.cse433 (bvadd .cse7 .cse431))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))) .cse429))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))))))) (concat ((_ extract 63 32) .cse430) ((_ extract 31 0) .cse430))) .cse10) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse437 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse436 (let ((.cse440 (bvadd .cse7 .cse437))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440))))) (or (= .cse10 (let ((.cse434 (bvadd (let ((.cse435 (bvadd .cse436 .cse429))) (concat ((_ extract 63 32) .cse435) ((_ extract 31 0) .cse435))) .cse437))) (concat ((_ extract 63 32) .cse434) ((_ extract 31 0) .cse434)))) (= (let ((.cse438 (bvadd (let ((.cse439 (bvadd .cse436 .cse23))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))) .cse437))) (concat ((_ extract 63 32) .cse438) ((_ extract 31 0) .cse438))) .cse10)))))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse443 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse441 (bvadd (let ((.cse442 (bvadd .cse216 .cse443))) (concat ((_ extract 63 32) .cse442) ((_ extract 31 0) .cse442))) .cse23))) (concat ((_ extract 63 32) .cse441) ((_ extract 31 0) .cse441))) .cse10) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse451 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse450 (let ((.cse456 (bvadd .cse7 .cse451))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))))) (or (= (let ((.cse444 (let ((.cse445 (concat .cse16 v_arrayElimCell_34))) (bvadd .cse445 (let ((.cse446 (bvadd .cse14 (let ((.cse447 (bvadd .cse445 .cse7))) (concat ((_ extract 63 32) .cse447) ((_ extract 31 0) .cse447)))))) (concat ((_ extract 63 32) .cse446) ((_ extract 31 0) .cse446))))))) (concat ((_ extract 63 32) .cse444) ((_ extract 31 0) .cse444))) .cse10) (= .cse10 (let ((.cse448 (bvadd (let ((.cse449 (bvadd .cse450 .cse443))) (concat ((_ extract 63 32) .cse449) ((_ extract 31 0) .cse449))) .cse451))) (concat ((_ extract 63 32) .cse448) ((_ extract 31 0) .cse448)))) (= (let ((.cse452 (bvadd (let ((.cse453 (bvadd .cse450 (concat .cse16 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse453) ((_ extract 31 0) .cse453))) .cse451))) (concat ((_ extract 63 32) .cse452) ((_ extract 31 0) .cse452))) .cse10) (= (let ((.cse454 (bvadd (let ((.cse455 (bvadd .cse450 .cse23))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455))) .cse451))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454))) .cse10))))) (= (let ((.cse457 (let ((.cse458 (concat v_arrayElimCell_35 .cse9))) (bvadd .cse458 (let ((.cse459 (bvadd (let ((.cse460 (bvadd .cse7 .cse458))) (concat ((_ extract 63 32) .cse460) ((_ extract 31 0) .cse460))) .cse443))) (concat ((_ extract 63 32) .cse459) ((_ extract 31 0) .cse459))))))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457))) .cse10))))))) .cse0)))))) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from true [2023-12-21 21:08:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-21 21:08:52,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:08:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241072260] [2023-12-21 21:08:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241072260] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:08:52,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:08:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-21 21:08:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123735471] [2023-12-21 21:08:52,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:08:52,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 21:08:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:08:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 21:08:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=608, Unknown=1, NotChecked=50, Total=756 [2023-12-21 21:08:52,453 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:08:57,585 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#sum~0#1.offset| (_ bv0 32)) (= (select .cse0 (_ bv4 32)) ((_ extract 63 32) (_ bv0 64))) (not (bvsle c_~N~0 (_ bv0 32))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (bvule c_~N~0 (_ bv536870911 32)) (= (select .cse0 (_ bv0 32)) ((_ extract 31 0) (_ bv0 64))) (or (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (let ((.cse10 ((_ extract 63 32) (_ bv1 64))) (.cse17 ((_ extract 31 0) (_ bv1 64)))) (let ((.cse24 (concat .cse10 .cse17)) (.cse8 (concat (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (.cse479 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse105 (= (_ bv8 32) .cse479)) (.cse217 (let ((.cse480 (bvadd .cse24 .cse8))) (concat ((_ extract 63 32) .cse480) ((_ extract 31 0) .cse480)))) (.cse15 (concat .cse17 .cse10)) (.cse464 (= .cse479 (_ bv0 32))) (.cse11 ((_ sign_extend 32) (bvadd c_~N~0 (_ bv1 32))))) (let ((.cse213 (= (bvadd (_ bv8 32) .cse479) (_ bv0 32))) (.cse2 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= (let ((.cse475 (let ((.cse478 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse476 (bvadd (let ((.cse477 (bvadd .cse8 .cse478))) (concat ((_ extract 63 32) .cse477) ((_ extract 31 0) .cse477))) .cse24))) (concat ((_ extract 63 32) .cse476) ((_ extract 31 0) .cse476))) .cse478)))) (concat ((_ extract 63 32) .cse475) ((_ extract 31 0) .cse475))) .cse11))) (.cse186 (not .cse464)) (.cse149 (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse467 (let ((.cse468 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse468 (let ((.cse469 (bvadd .cse15 (let ((.cse470 (bvadd .cse468 .cse8))) (concat ((_ extract 63 32) .cse470) ((_ extract 31 0) .cse470)))))) (concat ((_ extract 63 32) .cse469) ((_ extract 31 0) .cse469))))))) (concat ((_ extract 63 32) .cse467) ((_ extract 31 0) .cse467))) .cse11) (= (let ((.cse471 (let ((.cse474 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse472 (bvadd (let ((.cse473 (bvadd .cse8 .cse474))) (concat ((_ extract 63 32) .cse473) ((_ extract 31 0) .cse473))) .cse24))) (concat ((_ extract 63 32) .cse472) ((_ extract 31 0) .cse472))) .cse474)))) (concat ((_ extract 63 32) .cse471) ((_ extract 31 0) .cse471))) .cse11)))) (.cse214 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= (let ((.cse465 (bvadd (let ((.cse466 (bvadd .cse217 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse466) ((_ extract 31 0) .cse466))) .cse24))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))) .cse11))) (.cse3 (not .cse105)) (.cse1 (and (= (let ((.cse462 (bvadd .cse24 (let ((.cse463 (bvadd .cse217 .cse24))) (concat ((_ extract 63 32) .cse463) ((_ extract 31 0) .cse463)))))) (concat ((_ extract 63 32) .cse462) ((_ extract 31 0) .cse462))) .cse11) .cse464))) (and (or .cse1 (and (or .cse2 .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse9 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse4 (let ((.cse5 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse5 (let ((.cse6 (bvadd (let ((.cse7 (bvadd .cse8 .cse5))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse9))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6))))))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse21 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse20 (let ((.cse25 (bvadd .cse8 .cse21))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))))) (or (= (let ((.cse12 (let ((.cse13 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse13 (let ((.cse14 (bvadd .cse15 (let ((.cse16 (bvadd .cse13 .cse8))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16)))))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14))))))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12))) .cse11) (= .cse11 (let ((.cse18 (bvadd (let ((.cse19 (bvadd .cse20 .cse9))) (concat ((_ extract 63 32) .cse19) ((_ extract 31 0) .cse19))) .cse21))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18)))) (= (let ((.cse22 (bvadd (let ((.cse23 (bvadd .cse20 .cse24))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) .cse21))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse11)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse33 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse32 (let ((.cse36 (bvadd .cse8 .cse33))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))))) (or (= (let ((.cse26 (let ((.cse27 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse27 (let ((.cse28 (bvadd .cse15 (let ((.cse29 (bvadd .cse27 .cse8))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))))))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))) .cse11) (= .cse11 (let ((.cse30 (bvadd (let ((.cse31 (bvadd .cse32 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31))) .cse33))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30)))) (= (let ((.cse34 (bvadd (let ((.cse35 (bvadd .cse32 .cse24))) (concat ((_ extract 63 32) .cse35) ((_ extract 31 0) .cse35))) .cse33))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34))) .cse11))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse44 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse45 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse43 (let ((.cse50 (bvadd .cse8 .cse45))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))))) (or (= (let ((.cse37 (let ((.cse38 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse38 (let ((.cse39 (bvadd .cse15 (let ((.cse40 (bvadd .cse38 .cse8))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse11) (= .cse11 (let ((.cse41 (bvadd (let ((.cse42 (bvadd .cse43 .cse44))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse45))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41)))) (= (let ((.cse46 (bvadd (let ((.cse47 (bvadd .cse43 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse45))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))) .cse11) (= (let ((.cse48 (bvadd (let ((.cse49 (bvadd .cse43 .cse24))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) .cse45))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse11))))) (= (let ((.cse51 (let ((.cse52 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse52 (let ((.cse53 (bvadd (let ((.cse54 (bvadd .cse8 .cse52))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse44))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))))))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse11)))) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse59 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (= .cse11 (let ((.cse55 (let ((.cse58 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse56 (bvadd (let ((.cse57 (bvadd .cse8 .cse58))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57))) .cse59))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse58)))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))))) (= (let ((.cse60 (let ((.cse61 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse61 (let ((.cse62 (bvadd (let ((.cse63 (bvadd .cse8 .cse61))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse59))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))))))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse11)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse68 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse64 (let ((.cse65 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse65 (let ((.cse66 (bvadd (let ((.cse67 (bvadd .cse8 .cse65))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse68))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))))))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse76 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse75 (let ((.cse79 (bvadd .cse8 .cse76))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))))) (or (= (let ((.cse69 (let ((.cse70 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse70 (let ((.cse71 (bvadd .cse15 (let ((.cse72 (bvadd .cse70 .cse8))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72)))))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))))))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69))) .cse11) (= .cse11 (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse75 .cse68))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse76))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73)))) (= (let ((.cse77 (bvadd (let ((.cse78 (bvadd .cse75 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse76))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))) .cse11)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse84 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse80 (let ((.cse81 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse81 (let ((.cse82 (bvadd (let ((.cse83 (bvadd .cse8 .cse81))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse84))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse88 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse87 (let ((.cse91 (bvadd .cse8 .cse88))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91))))) (or (= .cse11 (let ((.cse85 (bvadd (let ((.cse86 (bvadd .cse87 .cse84))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse88))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85)))) (= (let ((.cse89 (bvadd (let ((.cse90 (bvadd .cse87 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse90) ((_ extract 31 0) .cse90))) .cse88))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) .cse11)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse96 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse92 (let ((.cse93 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse93 (let ((.cse94 (bvadd (let ((.cse95 (bvadd .cse8 .cse93))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))) .cse96))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))))))) (concat ((_ extract 63 32) .cse92) ((_ extract 31 0) .cse92))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse97 (let ((.cse98 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse98 (let ((.cse99 (bvadd .cse15 (let ((.cse100 (bvadd .cse98 .cse8))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100)))))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))))))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse11) (= .cse11 (let ((.cse101 (let ((.cse104 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse102 (bvadd (let ((.cse103 (bvadd .cse8 .cse104))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse96))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) .cse104)))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101)))))))))) .cse105) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (= .cse11 (let ((.cse106 (let ((.cse109 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse107 (bvadd (let ((.cse108 (bvadd .cse8 .cse109))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) .cse109)))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse113 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse112 (let ((.cse116 (bvadd .cse8 .cse113))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))))) (or (= .cse11 (let ((.cse110 (bvadd (let ((.cse111 (bvadd .cse112 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse113))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110)))) (= (let ((.cse114 (bvadd (let ((.cse115 (bvadd .cse112 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse113))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114))) .cse11))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse117 (let ((.cse118 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse118 (let ((.cse119 (bvadd .cse15 (let ((.cse120 (bvadd .cse118 .cse8))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120)))))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))))))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse11) (= .cse11 (let ((.cse121 (let ((.cse124 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse122 (bvadd (let ((.cse123 (bvadd .cse8 .cse124))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse124)))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse132 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse131 (let ((.cse135 (bvadd .cse8 .cse132))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))))) (or (= (let ((.cse125 (let ((.cse126 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse126 (let ((.cse127 (bvadd .cse15 (let ((.cse128 (bvadd .cse126 .cse8))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128)))))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))))))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse11) (= .cse11 (let ((.cse129 (bvadd (let ((.cse130 (bvadd .cse131 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130))) .cse132))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))) (= (let ((.cse133 (bvadd (let ((.cse134 (bvadd .cse131 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) .cse132))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse11)))))) .cse105) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse143 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse142 (let ((.cse148 (bvadd .cse8 .cse143))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))))) (or (= (let ((.cse136 (let ((.cse137 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse137 (let ((.cse138 (bvadd .cse15 (let ((.cse139 (bvadd .cse137 .cse8))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139)))))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))))))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse11) (= .cse11 (let ((.cse140 (bvadd (let ((.cse141 (bvadd .cse142 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse143))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))) (= (let ((.cse144 (bvadd (let ((.cse145 (bvadd .cse142 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse143))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) .cse11) (= (let ((.cse146 (bvadd (let ((.cse147 (bvadd .cse142 .cse24))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147))) .cse143))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146))) .cse11))))) (or .cse149 .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse153 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse152 (let ((.cse158 (bvadd .cse8 .cse153))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))))) (or (= .cse11 (let ((.cse150 (bvadd (let ((.cse151 (bvadd .cse152 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151))) .cse153))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))) (= (let ((.cse154 (bvadd (let ((.cse155 (bvadd .cse152 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse153))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) .cse11) (= (let ((.cse156 (bvadd (let ((.cse157 (bvadd .cse152 .cse24))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))) .cse153))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse11))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse162 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse161 (let ((.cse165 (bvadd .cse8 .cse162))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165))))) (or (= .cse11 (let ((.cse159 (bvadd (let ((.cse160 (bvadd .cse161 (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160))) .cse162))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159)))) (= (let ((.cse163 (bvadd (let ((.cse164 (bvadd .cse161 .cse24))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse162))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse11))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse166 (let ((.cse167 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse167 (let ((.cse168 (bvadd (let ((.cse169 (bvadd .cse8 .cse167))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))))))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))) .cse11) (= (let ((.cse170 (let ((.cse173 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse171 (bvadd (let ((.cse172 (bvadd .cse8 .cse173))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))) .cse24))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))) .cse173)))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170))) .cse11))) .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse178 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse174 (let ((.cse175 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse175 (let ((.cse176 (bvadd (let ((.cse177 (bvadd .cse8 .cse175))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse178))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))))))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse182 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse181 (let ((.cse185 (bvadd .cse8 .cse182))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))))) (or (= .cse11 (let ((.cse179 (bvadd (let ((.cse180 (bvadd .cse181 .cse178))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse182))) (concat ((_ extract 63 32) .cse179) ((_ extract 31 0) .cse179)))) (= (let ((.cse183 (bvadd (let ((.cse184 (bvadd .cse181 .cse24))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse182))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183))) .cse11)))))))) .cse186 (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse191 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse187 (let ((.cse188 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse188 (let ((.cse189 (bvadd (let ((.cse190 (bvadd .cse8 .cse188))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))) .cse191))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189))))))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse195 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse194 (let ((.cse200 (bvadd .cse8 .cse195))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))))) (or (= .cse11 (let ((.cse192 (bvadd (let ((.cse193 (bvadd .cse194 .cse191))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))) .cse195))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192)))) (= (let ((.cse196 (bvadd (let ((.cse197 (bvadd .cse194 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) .cse195))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse11) (= (let ((.cse198 (bvadd (let ((.cse199 (bvadd .cse194 .cse24))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))) .cse195))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse11)))))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (or (= (let ((.cse201 (let ((.cse202 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse202 (let ((.cse203 (bvadd (let ((.cse204 (bvadd .cse8 .cse202))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204))) (concat v_arrayElimCell_33 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203))))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse11) (= (let ((.cse205 (let ((.cse206 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse206 (let ((.cse207 (bvadd .cse15 (let ((.cse208 (bvadd .cse206 .cse8))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208)))))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207))))))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))) .cse11) (= (let ((.cse209 (let ((.cse212 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse210 (bvadd (let ((.cse211 (bvadd .cse8 .cse212))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse24))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse212)))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse11))) .cse3)) .cse213) (or (not .cse213) .cse214) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse218 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse215 (bvadd (let ((.cse216 (bvadd .cse217 .cse218))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216))) .cse24))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse222 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse221 (let ((.cse225 (bvadd .cse8 .cse222))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))))) (or (= .cse11 (let ((.cse219 (bvadd (let ((.cse220 (bvadd .cse221 .cse218))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse222))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219)))) (= (let ((.cse223 (bvadd (let ((.cse224 (bvadd .cse221 .cse24))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse222))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse11)))))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse228 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse226 (bvadd (let ((.cse227 (bvadd .cse217 .cse228))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) .cse24))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse11) (= (let ((.cse229 (let ((.cse230 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse230 (let ((.cse231 (bvadd (let ((.cse232 (bvadd .cse8 .cse230))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232))) .cse228))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))))))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229))) .cse11) (= (let ((.cse233 (let ((.cse236 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse234 (bvadd (let ((.cse235 (bvadd .cse8 .cse236))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse24))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234))) .cse236)))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))) .cse11)))) .cse3) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse245 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse237 (let ((.cse238 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse238 (let ((.cse239 (bvadd .cse15 (let ((.cse240 (bvadd .cse238 .cse8))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240)))))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))))))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237))) .cse11) (= .cse11 (let ((.cse241 (let ((.cse244 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse242 (bvadd (let ((.cse243 (bvadd .cse8 .cse244))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse245))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse244)))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241)))))) (= (let ((.cse246 (bvadd (let ((.cse247 (bvadd .cse217 .cse245))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse24))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) .cse11)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse252 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (= .cse11 (let ((.cse248 (let ((.cse251 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse249 (bvadd (let ((.cse250 (bvadd .cse8 .cse251))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250))) .cse252))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse251)))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))))) (= (let ((.cse253 (bvadd (let ((.cse254 (bvadd .cse217 .cse252))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse24))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse11)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse257 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse255 (bvadd (let ((.cse256 (bvadd .cse217 .cse257))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse24))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse261 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse260 (let ((.cse264 (bvadd .cse8 .cse261))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))))) (or (= .cse11 (let ((.cse258 (bvadd (let ((.cse259 (bvadd .cse260 .cse257))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))) .cse261))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258)))) (= (let ((.cse262 (bvadd (let ((.cse263 (bvadd .cse260 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse261))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262))) .cse11)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse267 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse265 (bvadd (let ((.cse266 (bvadd .cse217 .cse267))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse24))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse275 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse274 (let ((.cse278 (bvadd .cse8 .cse275))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))))) (or (= (let ((.cse268 (let ((.cse269 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse269 (let ((.cse270 (bvadd .cse15 (let ((.cse271 (bvadd .cse269 .cse8))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271)))))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))))))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268))) .cse11) (= .cse11 (let ((.cse272 (bvadd (let ((.cse273 (bvadd .cse274 .cse267))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273))) .cse275))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272)))) (= (let ((.cse276 (bvadd (let ((.cse277 (bvadd .cse274 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))) .cse275))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse11))))))))) .cse105) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse281 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse279 (bvadd (let ((.cse280 (bvadd .cse217 .cse281))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))) .cse24))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse282 (let ((.cse283 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse283 (let ((.cse284 (bvadd (let ((.cse285 (bvadd .cse8 .cse283))) (concat ((_ extract 63 32) .cse285) ((_ extract 31 0) .cse285))) .cse281))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284))))))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse293 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse292 (let ((.cse296 (bvadd .cse8 .cse293))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))))) (or (= (let ((.cse286 (let ((.cse287 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse287 (let ((.cse288 (bvadd .cse15 (let ((.cse289 (bvadd .cse287 .cse8))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289)))))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288))))))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse11) (= .cse11 (let ((.cse290 (bvadd (let ((.cse291 (bvadd .cse292 .cse281))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse293))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290)))) (= (let ((.cse294 (bvadd (let ((.cse295 (bvadd .cse292 .cse24))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))) .cse293))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294))) .cse11)))))))))) (or .cse2 .cse214 .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse299 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse297 (bvadd (let ((.cse298 (bvadd .cse217 .cse299))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse24))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse307 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse306 (let ((.cse310 (bvadd .cse8 .cse307))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))))) (or (= (let ((.cse300 (let ((.cse301 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse301 (let ((.cse302 (bvadd .cse15 (let ((.cse303 (bvadd .cse301 .cse8))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303)))))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302))))))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300))) .cse11) (= .cse11 (let ((.cse304 (bvadd (let ((.cse305 (bvadd .cse306 .cse299))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305))) .cse307))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304)))) (= (let ((.cse308 (bvadd (let ((.cse309 (bvadd .cse306 .cse24))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))) .cse307))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))) .cse11)))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse313 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse311 (bvadd (let ((.cse312 (bvadd .cse217 .cse313))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse24))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse317 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse316 (let ((.cse322 (bvadd .cse8 .cse317))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))))) (or (= .cse11 (let ((.cse314 (bvadd (let ((.cse315 (bvadd .cse316 .cse313))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse317))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))) (= (let ((.cse318 (bvadd (let ((.cse319 (bvadd .cse316 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))) .cse317))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse11) (= (let ((.cse320 (bvadd (let ((.cse321 (bvadd .cse316 .cse24))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321))) .cse317))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320))) .cse11)))))))) (or .cse186 .cse214) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse325 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse323 (bvadd (let ((.cse324 (bvadd .cse217 .cse325))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))) .cse24))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (= .cse11 (let ((.cse326 (let ((.cse329 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse327 (bvadd (let ((.cse328 (bvadd .cse8 .cse329))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328))) .cse325))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse329)))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))))) (= (let ((.cse330 (let ((.cse331 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse331 (let ((.cse332 (bvadd (let ((.cse333 (bvadd .cse8 .cse331))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse325))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))))))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))) .cse11)))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse336 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse334 (bvadd (let ((.cse335 (bvadd .cse217 .cse336))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))) .cse24))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse337 (let ((.cse338 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse338 (let ((.cse339 (bvadd (let ((.cse340 (bvadd .cse8 .cse338))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) .cse336))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))))))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (or (= (let ((.cse341 (let ((.cse342 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse342 (let ((.cse343 (bvadd .cse15 (let ((.cse344 (bvadd .cse342 .cse8))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344)))))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))))))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341))) .cse11) (= .cse11 (let ((.cse345 (let ((.cse348 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse346 (bvadd (let ((.cse347 (bvadd .cse8 .cse348))) (concat ((_ extract 63 32) .cse347) ((_ extract 31 0) .cse347))) .cse336))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse348)))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))))))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse351 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse349 (bvadd (let ((.cse350 (bvadd .cse217 .cse351))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350))) .cse24))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse352 (let ((.cse353 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse353 (let ((.cse354 (bvadd (let ((.cse355 (bvadd .cse8 .cse353))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))) .cse351))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354))))))) (concat ((_ extract 63 32) .cse352) ((_ extract 31 0) .cse352))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse363 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse362 (let ((.cse366 (bvadd .cse8 .cse363))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366))))) (or (= (let ((.cse356 (let ((.cse357 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse357 (let ((.cse358 (bvadd .cse15 (let ((.cse359 (bvadd .cse357 .cse8))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359)))))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))))))) (concat ((_ extract 63 32) .cse356) ((_ extract 31 0) .cse356))) .cse11) (= .cse11 (let ((.cse360 (bvadd (let ((.cse361 (bvadd .cse362 .cse351))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))) .cse363))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360)))) (= (let ((.cse364 (bvadd (let ((.cse365 (bvadd .cse362 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse363))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse11)))))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse371 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse367 (let ((.cse368 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse368 (let ((.cse369 (bvadd (let ((.cse370 (bvadd .cse8 .cse368))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370))) .cse371))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))))))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse375 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse374 (let ((.cse378 (bvadd .cse8 .cse375))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))))) (or (= .cse11 (let ((.cse372 (bvadd (let ((.cse373 (bvadd .cse374 .cse371))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))) .cse375))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372)))) (= (let ((.cse376 (bvadd (let ((.cse377 (bvadd .cse374 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377))) .cse375))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse11))))))) (= (let ((.cse379 (bvadd (let ((.cse380 (bvadd .cse217 .cse371))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))) .cse24))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))) .cse11))))) .cse105) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse383 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse381 (bvadd (let ((.cse382 (bvadd .cse217 .cse383))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))) .cse24))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse11) (= (let ((.cse384 (let ((.cse385 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse385 (let ((.cse386 (bvadd (let ((.cse387 (bvadd .cse8 .cse385))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse383))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386))))))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384))) .cse11) (= (let ((.cse388 (let ((.cse389 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse389 (let ((.cse390 (bvadd .cse15 (let ((.cse391 (bvadd .cse389 .cse8))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391)))))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390))))))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388))) .cse11) (= (let ((.cse392 (let ((.cse395 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (bvadd (let ((.cse393 (bvadd (let ((.cse394 (bvadd .cse8 .cse395))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394))) .cse24))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393))) .cse395)))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse11)))) .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse398 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse396 (bvadd (let ((.cse397 (bvadd .cse217 .cse398))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397))) .cse24))) (concat ((_ extract 63 32) .cse396) ((_ extract 31 0) .cse396))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse399 (let ((.cse400 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse400 (let ((.cse401 (bvadd (let ((.cse402 (bvadd .cse8 .cse400))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402))) .cse398))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401))))))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse406 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse405 (let ((.cse411 (bvadd .cse8 .cse406))) (concat ((_ extract 63 32) .cse411) ((_ extract 31 0) .cse411))))) (or (= .cse11 (let ((.cse403 (bvadd (let ((.cse404 (bvadd .cse405 .cse398))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404))) .cse406))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))) (= (let ((.cse407 (bvadd (let ((.cse408 (bvadd .cse405 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408))) .cse406))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407))) .cse11) (= (let ((.cse409 (bvadd (let ((.cse410 (bvadd .cse405 .cse24))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse406))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse11)))))))))) (or .cse149 .cse214 .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse419 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_35 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse420 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse418 (let ((.cse425 (bvadd .cse8 .cse420))) (concat ((_ extract 63 32) .cse425) ((_ extract 31 0) .cse425))))) (or (= (let ((.cse412 (let ((.cse413 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse413 (let ((.cse414 (bvadd .cse15 (let ((.cse415 (bvadd .cse413 .cse8))) (concat ((_ extract 63 32) .cse415) ((_ extract 31 0) .cse415)))))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414))))))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412))) .cse11) (= .cse11 (let ((.cse416 (bvadd (let ((.cse417 (bvadd .cse418 .cse419))) (concat ((_ extract 63 32) .cse417) ((_ extract 31 0) .cse417))) .cse420))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416)))) (= (let ((.cse421 (bvadd (let ((.cse422 (bvadd .cse418 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse422) ((_ extract 31 0) .cse422))) .cse420))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421))) .cse11) (= (let ((.cse423 (bvadd (let ((.cse424 (bvadd .cse418 .cse24))) (concat ((_ extract 63 32) .cse424) ((_ extract 31 0) .cse424))) .cse420))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))) .cse11))))) (= (let ((.cse426 (bvadd (let ((.cse427 (bvadd .cse217 .cse419))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse24))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426))) .cse11)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse430 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse428 (bvadd (let ((.cse429 (bvadd .cse217 .cse430))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429))) .cse24))) (concat ((_ extract 63 32) .cse428) ((_ extract 31 0) .cse428))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (= (let ((.cse431 (let ((.cse432 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse432 (let ((.cse433 (bvadd (let ((.cse434 (bvadd .cse8 .cse432))) (concat ((_ extract 63 32) .cse434) ((_ extract 31 0) .cse434))) .cse430))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))))))) (concat ((_ extract 63 32) .cse431) ((_ extract 31 0) .cse431))) .cse11) (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse438 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse437 (let ((.cse441 (bvadd .cse8 .cse438))) (concat ((_ extract 63 32) .cse441) ((_ extract 31 0) .cse441))))) (or (= .cse11 (let ((.cse435 (bvadd (let ((.cse436 (bvadd .cse437 .cse430))) (concat ((_ extract 63 32) .cse436) ((_ extract 31 0) .cse436))) .cse438))) (concat ((_ extract 63 32) .cse435) ((_ extract 31 0) .cse435)))) (= (let ((.cse439 (bvadd (let ((.cse440 (bvadd .cse437 .cse24))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440))) .cse438))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))) .cse11)))))))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_33 (_ BitVec 32))) (let ((.cse444 (concat v_arrayElimCell_33 v_arrayElimCell_36))) (or (= (let ((.cse442 (bvadd (let ((.cse443 (bvadd .cse217 .cse444))) (concat ((_ extract 63 32) .cse443) ((_ extract 31 0) .cse443))) .cse24))) (concat ((_ extract 63 32) .cse442) ((_ extract 31 0) .cse442))) .cse11) (forall ((v_arrayElimCell_35 (_ BitVec 32))) (or (forall ((v_arrayElimCell_34 (_ BitVec 32))) (let ((.cse452 (concat v_arrayElimCell_35 v_arrayElimCell_34))) (let ((.cse451 (let ((.cse457 (bvadd .cse8 .cse452))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457))))) (or (= (let ((.cse445 (let ((.cse446 (concat .cse17 v_arrayElimCell_34))) (bvadd .cse446 (let ((.cse447 (bvadd .cse15 (let ((.cse448 (bvadd .cse446 .cse8))) (concat ((_ extract 63 32) .cse448) ((_ extract 31 0) .cse448)))))) (concat ((_ extract 63 32) .cse447) ((_ extract 31 0) .cse447))))))) (concat ((_ extract 63 32) .cse445) ((_ extract 31 0) .cse445))) .cse11) (= .cse11 (let ((.cse449 (bvadd (let ((.cse450 (bvadd .cse451 .cse444))) (concat ((_ extract 63 32) .cse450) ((_ extract 31 0) .cse450))) .cse452))) (concat ((_ extract 63 32) .cse449) ((_ extract 31 0) .cse449)))) (= (let ((.cse453 (bvadd (let ((.cse454 (bvadd .cse451 (concat .cse17 v_arrayElimCell_36)))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454))) .cse452))) (concat ((_ extract 63 32) .cse453) ((_ extract 31 0) .cse453))) .cse11) (= (let ((.cse455 (bvadd (let ((.cse456 (bvadd .cse451 .cse24))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))) .cse452))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455))) .cse11))))) (= (let ((.cse458 (let ((.cse459 (concat v_arrayElimCell_35 .cse10))) (bvadd .cse459 (let ((.cse460 (bvadd (let ((.cse461 (bvadd .cse8 .cse459))) (concat ((_ extract 63 32) .cse461) ((_ extract 31 0) .cse461))) .cse444))) (concat ((_ extract 63 32) .cse460) ((_ extract 31 0) .cse460))))))) (concat ((_ extract 63 32) .cse458) ((_ extract 31 0) .cse458))) .cse11))))))) .cse1)))))) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))))) is different from true [2023-12-21 21:09:08,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 21:09:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:09:09,511 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2023-12-21 21:09:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 21:09:09,512 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-21 21:09:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:09:09,514 INFO L225 Difference]: With dead ends: 51 [2023-12-21 21:09:09,514 INFO L226 Difference]: Without dead ends: 35 [2023-12-21 21:09:09,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=194, Invalid=1144, Unknown=2, NotChecked=142, Total=1482 [2023-12-21 21:09:09,515 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:09:09,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 68 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 303 Invalid, 1 Unknown, 61 Unchecked, 7.2s Time] [2023-12-21 21:09:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-21 21:09:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-12-21 21:09:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 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) [2023-12-21 21:09:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-12-21 21:09:09,533 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2023-12-21 21:09:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:09:09,533 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-12-21 21:09:09,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:09:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-12-21 21:09:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 21:09:09,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:09:09,534 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:09:09,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 21:09:09,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:09:09,738 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:09:09,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:09:09,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1546114613, now seen corresponding path program 5 times [2023-12-21 21:09:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:09:09,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187329467] [2023-12-21 21:09:09,739 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 21:09:09,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:09:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:09:09,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:09:09,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 21:09:09,876 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 21:09:09,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:09:09,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 21:09:09,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:09:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 21:09:10,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:09:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 21:09:11,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:09:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187329467] [2023-12-21 21:09:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187329467] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:09:11,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:09:11,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-21 21:09:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477364803] [2023-12-21 21:09:11,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:09:11,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 21:09:11,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:09:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 21:09:11,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-12-21 21:09:11,935 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:09:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:09:13,794 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2023-12-21 21:09:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 21:09:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-21 21:09:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:09:13,795 INFO L225 Difference]: With dead ends: 96 [2023-12-21 21:09:13,795 INFO L226 Difference]: Without dead ends: 72 [2023-12-21 21:09:13,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2023-12-21 21:09:13,796 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 269 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:09:13,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 109 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 21:09:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-21 21:09:13,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 46. [2023-12-21 21:09:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:09:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-12-21 21:09:13,822 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 20 [2023-12-21 21:09:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:09:13,822 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-12-21 21:09:13,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:09:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-12-21 21:09:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 21:09:13,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:09:13,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:09:13,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 21:09:14,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:09:14,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:09:14,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:09:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 350502234, now seen corresponding path program 6 times [2023-12-21 21:09:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:09:14,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564730232] [2023-12-21 21:09:14,024 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 21:09:14,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:09:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:09:14,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 21:09:14,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 21:09:14,174 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-12-21 21:09:14,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:09:14,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-21 21:09:14,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:09:14,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:09:14,364 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 18 treesize of output 19 [2023-12-21 21:09:14,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:09:14,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-12-21 21:09:14,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:09:14,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2023-12-21 21:09:14,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 21:09:14,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:14,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2023-12-21 21:09:16,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:16,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 59 [2023-12-21 21:09:16,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:16,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 99 [2023-12-21 21:09:16,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:16,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 175 [2023-12-21 21:09:17,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:17,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 411 treesize of output 241 [2023-12-21 21:09:18,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:18,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 349 treesize of output 301 [2023-12-21 21:09:18,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:18,844 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 345 treesize of output 275 [2023-12-21 21:09:18,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:18,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 999 treesize of output 975 [2023-12-21 21:09:19,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:09:19,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1005 treesize of output 951 [2023-12-21 21:09:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:09:19,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:09:39,956 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 3882 treesize of output 3762 [2023-12-21 21:09:52,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:09:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564730232] [2023-12-21 21:09:52,468 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 21:09:52,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 21:09:52,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:09:52,669 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 99613 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) 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:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:291) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) 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:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 99613 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2023-12-21 21:09:52,672 INFO L158 Benchmark]: Toolchain (without parser) took 97194.76ms. Allocated memory was 342.9MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 288.8MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 720.5MB. Max. memory is 8.0GB. [2023-12-21 21:09:52,672 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 205.5MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 21:09:52,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.60ms. Allocated memory is still 342.9MB. Free memory was 288.8MB in the beginning and 276.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 21:09:52,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.03ms. Allocated memory is still 342.9MB. Free memory was 276.7MB in the beginning and 275.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:09:52,672 INFO L158 Benchmark]: Boogie Preprocessor took 47.10ms. Allocated memory is still 342.9MB. Free memory was 275.2MB in the beginning and 272.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:09:52,673 INFO L158 Benchmark]: RCFGBuilder took 455.64ms. Allocated memory is still 342.9MB. Free memory was 272.5MB in the beginning and 255.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 21:09:52,673 INFO L158 Benchmark]: TraceAbstraction took 96450.56ms. Allocated memory was 342.9MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 254.7MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 686.9MB. Max. memory is 8.0GB. [2023-12-21 21:09:52,674 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 205.5MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.60ms. Allocated memory is still 342.9MB. Free memory was 288.8MB in the beginning and 276.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.03ms. Allocated memory is still 342.9MB. Free memory was 276.7MB in the beginning and 275.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.10ms. Allocated memory is still 342.9MB. Free memory was 275.2MB in the beginning and 272.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 455.64ms. Allocated memory is still 342.9MB. Free memory was 272.5MB in the beginning and 255.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 96450.56ms. Allocated memory was 342.9MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 254.7MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 686.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 99613 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 99613 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-21 21:09:52,880 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 21:09:52,933 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 137 Received shutdown request...