/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 --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 01:41:23,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 01:41:23,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 01:41:23,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 01:41:23,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 01:41:23,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 01:41:23,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 01:41:23,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 01:41:23,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 01:41:23,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 01:41:23,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 01:41:23,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 01:41:23,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 01:41:23,762 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 01:41:23,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 01:41:23,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 01:41:23,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 01:41:23,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 01:41:23,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 01:41:23,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 01:41:23,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 01:41:23,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 01:41:23,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 01:41:23,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 01:41:23,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 01:41:23,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 01:41:23,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 01:41:23,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 01:41:23,772 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 01:41:23,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 01:41:23,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:41:23,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 01:41:23,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 01:41:23,773 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 01:41:23,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 01:41:23,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 01:41:23,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 01:41:23,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 01:41:23,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 01:41:23,774 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 01:41:23,774 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 01:41:23,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 01:41:23,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 01:41:23,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 01:41:24,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 01:41:24,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 01:41:24,001 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 01:41:24,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2024-01-26 01:41:25,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 01:41:25,180 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 01:41:25,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2024-01-26 01:41:25,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b02cbf2f6/d586ba08553f4d57b71c083e3096c91d/FLAGb7360678b [2024-01-26 01:41:25,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b02cbf2f6/d586ba08553f4d57b71c083e3096c91d [2024-01-26 01:41:25,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 01:41:25,201 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 01:41:25,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 01:41:25,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 01:41:25,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 01:41:25,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ede3d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25, skipping insertion in model container [2024-01-26 01:41:25,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,228 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 01:41:25,357 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-01-26 01:41:25,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:41:25,373 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 01:41:25,398 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-01-26 01:41:25,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:41:25,415 INFO L206 MainTranslator]: Completed translation [2024-01-26 01:41:25,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25 WrapperNode [2024-01-26 01:41:25,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 01:41:25,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 01:41:25,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 01:41:25,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 01:41:25,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,456 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2024-01-26 01:41:25,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 01:41:25,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 01:41:25,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 01:41:25,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 01:41:25,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 01:41:25,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 01:41:25,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 01:41:25,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 01:41:25,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (1/1) ... [2024-01-26 01:41:25,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:41:25,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:25,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-01-26 01:41:25,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-01-26 01:41:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 01:41:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 01:41:25,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 01:41:25,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 01:41:25,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 01:41:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 01:41:25,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 01:41:25,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 01:41:25,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 01:41:25,603 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 01:41:25,681 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 01:41:25,682 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 01:41:25,911 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 01:41:25,981 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 01:41:25,981 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 01:41:25,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:41:25 BoogieIcfgContainer [2024-01-26 01:41:25,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 01:41:25,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 01:41:25,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 01:41:26,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 01:41:26,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 01:41:25" (1/3) ... [2024-01-26 01:41:26,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af8437b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:41:26, skipping insertion in model container [2024-01-26 01:41:26,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:25" (2/3) ... [2024-01-26 01:41:26,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af8437b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:41:26, skipping insertion in model container [2024-01-26 01:41:26,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:41:25" (3/3) ... [2024-01-26 01:41:26,003 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2024-01-26 01:41:26,009 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 01:41:26,020 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 01:41:26,020 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 01:41:26,020 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 01:41:26,165 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 01:41:26,221 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:41:26,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 01:41:26,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:26,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 01:41:26,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-01-26 01:41:26,266 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 01:41:26,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 01:41:26,282 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@202d03e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:41:26,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 01:41:26,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:26,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:26,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1811752127, now seen corresponding path program 1 times [2024-01-26 01:41:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036273340] [2024-01-26 01:41:26,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:41:26,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:26,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036273340] [2024-01-26 01:41:26,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036273340] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:41:26,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 01:41:26,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 01:41:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461209617] [2024-01-26 01:41:26,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:41:26,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 01:41:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:26,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 01:41:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 01:41:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:26,991 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:26,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 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) [2024-01-26 01:41:26,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:27,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 01:41:27,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:27,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1173572647, now seen corresponding path program 1 times [2024-01-26 01:41:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:27,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592531078] [2024-01-26 01:41:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:27,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:41:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592531078] [2024-01-26 01:41:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592531078] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432204469] [2024-01-26 01:41:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:27,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:27,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:27,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:27,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-26 01:41:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:27,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 01:41:27,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:41:27,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:41:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:41:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432204469] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:27,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 01:41:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-01-26 01:41:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618207368] [2024-01-26 01:41:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:41:27,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 01:41:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 01:41:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-01-26 01:41:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:27,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:27,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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) [2024-01-26 01:41:27,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:27,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:28,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-26 01:41:28,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-01-26 01:41:28,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:28,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1296617505, now seen corresponding path program 1 times [2024-01-26 01:41:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:28,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727991990] [2024-01-26 01:41:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-26 01:41:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727991990] [2024-01-26 01:41:28,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727991990] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833102234] [2024-01-26 01:41:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:28,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:28,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:28,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:28,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-26 01:41:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:28,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 01:41:28,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:41:28,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:41:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 01:41:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833102234] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:41:28,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:41:28,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2024-01-26 01:41:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873188228] [2024-01-26 01:41:28,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:41:28,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-26 01:41:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-26 01:41:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-01-26 01:41:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:28,924 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:28,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.68) internal successors, (242), 25 states have internal predecessors, (242), 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) [2024-01-26 01:41:28,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:28,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:28,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:29,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-26 01:41:30,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:30,078 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:30,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2034078778, now seen corresponding path program 1 times [2024-01-26 01:41:30,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263942028] [2024-01-26 01:41:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-01-26 01:41:30,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:30,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263942028] [2024-01-26 01:41:30,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263942028] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:30,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973137451] [2024-01-26 01:41:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:30,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:30,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:30,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:30,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-26 01:41:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:30,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-26 01:41:30,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 01:41:30,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:41:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 01:41:31,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973137451] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:41:31,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:41:31,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2024-01-26 01:41:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383853214] [2024-01-26 01:41:31,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:41:31,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-01-26 01:41:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-01-26 01:41:31,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2024-01-26 01:41:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:31,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:31,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.805555555555555) internal successors, (281), 36 states have internal predecessors, (281), 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) [2024-01-26 01:41:31,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:31,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:31,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:31,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:41:32,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-26 01:41:33,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:33,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:33,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1657802065, now seen corresponding path program 2 times [2024-01-26 01:41:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:33,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331998906] [2024-01-26 01:41:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-01-26 01:41:33,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:33,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331998906] [2024-01-26 01:41:33,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331998906] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:33,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617242129] [2024-01-26 01:41:33,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 01:41:33,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:33,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:33,374 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-26 01:41:33,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-26 01:41:33,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:41:33,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-26 01:41:33,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-01-26 01:41:33,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-26 01:41:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617242129] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:41:33,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-26 01:41:33,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-01-26 01:41:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276020181] [2024-01-26 01:41:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:41:33,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 01:41:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:33,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 01:41:33,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2024-01-26 01:41:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:33,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:33,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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) [2024-01-26 01:41:33,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:33,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:33,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:33,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:41:33,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:41:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:34,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-26 01:41:34,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:34,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:34,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash -740306392, now seen corresponding path program 1 times [2024-01-26 01:41:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:34,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499963234] [2024-01-26 01:41:34,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-26 01:41:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499963234] [2024-01-26 01:41:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499963234] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393832521] [2024-01-26 01:41:34,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:34,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:34,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:34,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:34,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-26 01:41:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:34,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 18 conjunts are in the unsatisfiable core [2024-01-26 01:41:34,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 43 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-26 01:41:35,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:41:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-26 01:41:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393832521] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:41:35,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:41:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2024-01-26 01:41:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773147994] [2024-01-26 01:41:35,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:41:35,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-01-26 01:41:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:35,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-01-26 01:41:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2024-01-26 01:41:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:35,797 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:35,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.931818181818182) internal successors, (261), 44 states have internal predecessors, (261), 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) [2024-01-26 01:41:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:41:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:41:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:41:37,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-26 01:41:37,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:37,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:37,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash -592593564, now seen corresponding path program 2 times [2024-01-26 01:41:37,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:37,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770313391] [2024-01-26 01:41:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 73 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-01-26 01:41:37,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:37,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770313391] [2024-01-26 01:41:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770313391] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:37,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526161447] [2024-01-26 01:41:37,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 01:41:37,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:37,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:37,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:37,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-26 01:41:37,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 01:41:37,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:41:37,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-26 01:41:37,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 58 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-01-26 01:41:38,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:41:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 77 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-01-26 01:41:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526161447] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:41:38,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:41:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2024-01-26 01:41:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254221941] [2024-01-26 01:41:38,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:41:38,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-01-26 01:41:38,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:38,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-01-26 01:41:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2024-01-26 01:41:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:38,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:38,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.541666666666667) internal successors, (266), 48 states have internal predecessors, (266), 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) [2024-01-26 01:41:38,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:38,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:38,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:38,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:41:38,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:38,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:41:38,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:41:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:41:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:41:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:41:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-26 01:41:41,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-26 01:41:42,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-26 01:41:42,156 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:42,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 807880481, now seen corresponding path program 3 times [2024-01-26 01:41:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10150220] [2024-01-26 01:41:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 30 proven. 89 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-01-26 01:41:42,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:42,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10150220] [2024-01-26 01:41:42,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10150220] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:42,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475675894] [2024-01-26 01:41:42,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 01:41:42,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:42,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:42,622 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:42,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-26 01:41:42,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-01-26 01:41:42,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:41:42,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 88 conjunts are in the unsatisfiable core [2024-01-26 01:41:42,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:43,945 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 19 treesize of output 1 [2024-01-26 01:41:44,395 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 8 treesize of output 1 [2024-01-26 01:41:44,477 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 8 treesize of output 1 [2024-01-26 01:41:44,547 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 8 treesize of output 1 [2024-01-26 01:42:01,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 01:42:01,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:42:01,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 988 treesize of output 452 [2024-01-26 01:42:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 33 proven. 53 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-01-26 01:42:17,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:43:38,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse211 (* c_~N~0 4))) (let ((.cse1 (+ c_~max3~0 1)) (.cse12 (+ c_~max1~0 1)) (.cse158 (= c_~max1~0 c_~max2~0)) (.cse36 (= c_~max1~0 c_~max3~0)) (.cse5 (+ c_~max2~0 1)) (.cse4 (+ c_~A~0.offset 4)) (.cse7 (+ c_~A~0.offset .cse211 (- 4))) (.cse6 (+ c_~A~0.offset .cse211 (- 8)))) (and (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse7)) (.cse2 (select .cse3 c_~A~0.offset))) (or (< .cse0 .cse1) (= c_~max1~0 .cse2) (< .cse2 (select .cse3 .cse4)) (< c_~max1~0 .cse2) (< .cse2 .cse0) (< .cse2 .cse5) (< .cse2 (select .cse3 .cse6)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse8 (select .cse11 .cse6)) (.cse9 (select .cse11 .cse4)) (.cse10 (select .cse11 c_~A~0.offset))) (or (< c_~max2~0 .cse8) (< .cse9 (+ .cse10 1)) (= .cse8 c_~max2~0) (< .cse8 (select .cse11 .cse7)) (< .cse8 (+ .cse9 1)) (< .cse10 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse4)) (.cse14 (select .cse15 c_~A~0.offset))) (or (= .cse13 c_~max2~0) (< .cse13 (+ .cse14 1)) (< .cse13 (select .cse15 .cse7)) (< .cse13 (select .cse15 .cse6)) (< c_~max2~0 .cse13) (< .cse14 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse16 (select .cse19 .cse7)) (.cse17 (select .cse19 .cse4)) (.cse18 (select .cse19 c_~A~0.offset))) (or (< c_~max2~0 .cse16) (< .cse16 (+ .cse17 1)) (= .cse16 c_~max2~0) (< .cse17 (+ .cse18 1)) (< .cse17 (select .cse19 .cse6)) (< .cse18 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse4)) (.cse20 (select .cse22 .cse7))) (or (< .cse20 (+ .cse21 1)) (< .cse21 .cse12) (< c_~max1~0 (select .cse22 c_~A~0.offset)) (< .cse21 (select .cse22 .cse6)) (= .cse20 c_~max3~0) (< c_~max3~0 .cse20))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse25 (select .cse24 .cse6)) (.cse23 (select .cse24 c_~A~0.offset))) (or (< .cse23 (select .cse24 .cse4)) (< .cse25 (+ .cse23 1)) (< c_~max2~0 .cse25) (= .cse25 c_~max2~0) (< .cse25 (select .cse24 .cse7)) (< .cse23 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse26 (select .cse27 .cse7))) (or (< c_~max1~0 .cse26) (< .cse26 .cse1) (< c_~max2~0 (select .cse27 .cse6)) (< c_~max2~0 (select .cse27 c_~A~0.offset)) (< .cse26 .cse5) (= c_~max1~0 .cse26) (< c_~max2~0 (select .cse27 .cse4)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse4)) (.cse30 (select .cse29 .cse6)) (.cse31 (select .cse29 .cse7))) (or (< .cse28 .cse12) (< c_~max1~0 (select .cse29 c_~A~0.offset)) (< .cse30 (+ .cse28 1)) (= .cse31 c_~max3~0) (< .cse31 (+ .cse30 1)) (< c_~max3~0 .cse31))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse33 (select .cse35 .cse4)) (.cse34 (select .cse35 c_~A~0.offset)) (.cse32 (select .cse35 .cse6))) (or (< .cse32 c_~max3~0) (< .cse33 (+ .cse34 1)) (= c_~max1~0 .cse32) (< .cse32 (+ .cse33 1)) (< .cse34 .cse5) (< c_~max1~0 .cse32) (< c_~max3~0 (select .cse35 .cse7)))))) (or .cse36 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse37 (select .cse39 .cse7)) (.cse38 (select .cse39 .cse4))) (or (< c_~max1~0 .cse37) (< c_~max1~0 .cse38) (< .cse38 (select .cse39 .cse6)) (< c_~max3~0 (+ .cse38 1)) (< c_~max3~0 .cse37) (< .cse38 .cse5) (< c_~max2~0 (select .cse39 c_~A~0.offset))))))) (or .cse36 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse41 (select .cse43 .cse6)) (.cse40 (select .cse43 .cse7)) (.cse42 (select .cse43 .cse4))) (or (< c_~max1~0 .cse40) (< c_~max3~0 (+ .cse41 1)) (< .cse41 (+ .cse42 1)) (< c_~max1~0 .cse41) (< c_~max3~0 .cse40) (< .cse42 .cse5) (< c_~max2~0 (select .cse43 c_~A~0.offset))))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse44 (select .cse46 .cse7)) (.cse45 (select .cse46 c_~A~0.offset))) (or (< c_~max2~0 .cse44) (< .cse44 (+ .cse45 1)) (< .cse45 (select .cse46 .cse4)) (= .cse44 c_~max2~0) (< .cse45 (select .cse46 .cse6)) (< .cse45 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse47 (select .cse50 .cse7)) (.cse48 (select .cse50 .cse6)) (.cse49 (select .cse50 .cse4))) (or (< .cse47 .cse1) (= c_~max1~0 .cse48) (< .cse48 .cse47) (< .cse48 (+ .cse49 1)) (< c_~max1~0 .cse48) (< .cse49 .cse5) (< c_~max2~0 (select .cse50 c_~A~0.offset)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse51 (select .cse52 .cse7))) (or (< c_~max2~0 .cse51) (< c_~max1~0 (select .cse52 .cse4)) (= .cse51 c_~max2~0) (< c_~max1~0 (select .cse52 c_~A~0.offset)) (< c_~max1~0 (select .cse52 .cse6)) (< .cse51 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse7)) (.cse54 (select .cse55 c_~A~0.offset)) (.cse56 (select .cse55 .cse6))) (or (< .cse53 .cse1) (< .cse54 (select .cse55 .cse4)) (< .cse56 (+ .cse54 1)) (= c_~max1~0 .cse56) (< .cse56 .cse53) (< .cse54 .cse5) (< c_~max1~0 .cse56))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse57 (select .cse58 .cse4))) (or (= .cse57 c_~max1~0) (< .cse57 c_~max3~0) (< c_~max1~0 .cse57) (< .cse57 (select .cse58 .cse6)) (< c_~max3~0 (select .cse58 .cse7)) (< .cse57 .cse5) (< c_~max2~0 (select .cse58 c_~A~0.offset)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse59 (select .cse61 .cse4)) (.cse60 (select .cse61 c_~A~0.offset))) (or (= .cse59 c_~max1~0) (< .cse59 c_~max3~0) (< c_~max1~0 .cse59) (< .cse59 (+ .cse60 1)) (< .cse59 (select .cse61 .cse6)) (< .cse60 .cse5) (< c_~max3~0 (select .cse61 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse63 (select .cse62 .cse6)) (.cse64 (select .cse62 .cse7))) (or (< c_~max1~0 (select .cse62 .cse4)) (< c_~max1~0 (select .cse62 c_~A~0.offset)) (< .cse63 .cse12) (= .cse64 c_~max3~0) (< .cse64 (+ .cse63 1)) (< c_~max3~0 .cse64))))) (or .cse36 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse66 (select .cse67 c_~A~0.offset)) (.cse68 (select .cse67 .cse6)) (.cse65 (select .cse67 .cse7))) (or (< c_~max1~0 .cse65) (< .cse66 (select .cse67 .cse4)) (< .cse68 (+ .cse66 1)) (< c_~max3~0 (+ .cse68 1)) (< .cse66 .cse5) (< c_~max1~0 .cse68) (< c_~max3~0 .cse65)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse71 (select .cse70 .cse6)) (.cse69 (select .cse70 c_~A~0.offset))) (or (< .cse69 (select .cse70 .cse4)) (< .cse71 (+ .cse69 1)) (< c_~max3~0 (+ .cse71 1)) (< .cse71 (select .cse70 .cse7)) (< .cse69 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse75 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse73 (select .cse75 .cse4)) (.cse72 (select .cse75 .cse7)) (.cse74 (select .cse75 c_~A~0.offset))) (or (< .cse72 (+ .cse73 1)) (< .cse73 (+ .cse74 1)) (< .cse73 (select .cse75 .cse6)) (= .cse72 c_~max3~0) (< c_~max3~0 .cse72) (< .cse74 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse78 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse77 (select .cse78 .cse4)) (.cse76 (select .cse78 .cse7))) (or (< c_~max1~0 .cse76) (< .cse76 .cse1) (< .cse76 (+ .cse77 1)) (< .cse77 (select .cse78 .cse6)) (< .cse77 .cse5) (< c_~max2~0 (select .cse78 c_~A~0.offset)) (= c_~max1~0 .cse76))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse80 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse79 (select .cse80 .cse4))) (or (< .cse79 (select .cse80 .cse7)) (< .cse79 .cse12) (< c_~max1~0 (select .cse80 c_~A~0.offset)) (< .cse79 (select .cse80 .cse6)) (< c_~max3~0 (+ .cse79 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse82 (select .cse81 .cse6))) (or (< c_~max1~0 (select .cse81 .cse4)) (< c_~max3~0 (+ .cse82 1)) (< c_~max1~0 (select .cse81 c_~A~0.offset)) (< .cse82 .cse12) (< .cse82 (select .cse81 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse84 (select .cse85 c_~A~0.offset)) (.cse83 (select .cse85 .cse7))) (or (< c_~max1~0 .cse83) (< .cse83 .cse1) (< .cse83 (+ .cse84 1)) (< .cse84 (select .cse85 .cse4)) (< .cse84 .cse5) (< .cse84 (select .cse85 .cse6)) (= c_~max1~0 .cse83))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse88 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse87 (select .cse88 c_~A~0.offset)) (.cse86 (select .cse88 .cse6))) (or (< .cse86 c_~max3~0) (< .cse87 (select .cse88 .cse4)) (< .cse86 (+ .cse87 1)) (= c_~max1~0 .cse86) (< .cse87 .cse5) (< c_~max1~0 .cse86) (< c_~max3~0 (select .cse88 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse91 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse89 (select .cse91 .cse4)) (.cse90 (select .cse91 c_~A~0.offset))) (or (< .cse89 (+ .cse90 1)) (< .cse89 (select .cse91 .cse7)) (< .cse89 (select .cse91 .cse6)) (< c_~max3~0 (+ .cse89 1)) (< .cse90 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse93 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse92 (select .cse93 .cse4))) (or (= .cse92 c_~max2~0) (< .cse92 (select .cse93 .cse7)) (< .cse92 .cse12) (< c_~max1~0 (select .cse93 c_~A~0.offset)) (< .cse92 (select .cse93 .cse6)) (< c_~max2~0 .cse92))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse96 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse94 (select .cse96 .cse6)) (.cse95 (select .cse96 .cse4))) (or (< c_~max2~0 .cse94) (= .cse94 c_~max2~0) (< .cse95 .cse12) (< c_~max1~0 (select .cse96 c_~A~0.offset)) (< .cse94 (select .cse96 .cse7)) (< .cse94 (+ .cse95 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse98 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse97 (select .cse98 c_~A~0.offset))) (or (= c_~max1~0 .cse97) (< .cse97 (select .cse98 .cse4)) (< .cse97 c_~max3~0) (< c_~max1~0 .cse97) (< .cse97 .cse5) (< .cse97 (select .cse98 .cse6)) (< c_~max3~0 (select .cse98 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse100 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse101 (select .cse100 .cse6)) (.cse102 (select .cse100 .cse7)) (.cse99 (select .cse100 c_~A~0.offset))) (or (< .cse99 (select .cse100 .cse4)) (< .cse101 (+ .cse99 1)) (= .cse102 c_~max3~0) (< .cse102 (+ .cse101 1)) (< c_~max3~0 .cse102) (< .cse99 .cse12))))) (or .cse36 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse105 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse103 (select .cse105 c_~A~0.offset)) (.cse104 (select .cse105 .cse7))) (or (< c_~max3~0 (+ .cse103 1)) (< c_~max1~0 .cse104) (< .cse103 (select .cse105 .cse4)) (< c_~max1~0 .cse103) (< .cse103 .cse5) (< .cse103 (select .cse105 .cse6)) (< c_~max3~0 .cse104)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse107 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse106 (select .cse107 c_~A~0.offset))) (or (< c_~max3~0 (+ .cse106 1)) (< .cse106 (select .cse107 .cse4)) (< .cse106 (select .cse107 .cse7)) (< .cse106 (select .cse107 .cse6)) (< .cse106 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse110 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse108 (select .cse110 .cse7)) (.cse111 (select .cse110 .cse6)) (.cse109 (select .cse110 c_~A~0.offset))) (or (< c_~max2~0 .cse108) (< .cse109 (select .cse110 .cse4)) (< .cse111 (+ .cse109 1)) (= .cse108 c_~max2~0) (< .cse108 (+ .cse111 1)) (< .cse109 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse112 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse113 (select .cse112 .cse7))) (or (< c_~max1~0 (select .cse112 .cse4)) (< c_~max1~0 (select .cse112 c_~A~0.offset)) (= .cse113 c_~max3~0) (< c_~max1~0 (select .cse112 .cse6)) (< c_~max3~0 .cse113) (< .cse113 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse115 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse114 (select .cse115 .cse6))) (or (< .cse114 .cse5) (< .cse114 c_~max3~0) (= c_~max1~0 .cse114) (< c_~max1~0 .cse114) (< c_~max3~0 (select .cse115 .cse7)) (< c_~max2~0 (select .cse115 c_~A~0.offset)) (< c_~max2~0 (select .cse115 .cse4)))))) (or .cse36 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse118 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse117 (select .cse118 .cse6)) (.cse116 (select .cse118 .cse7))) (or (< c_~max1~0 .cse116) (< .cse117 .cse5) (< c_~max3~0 (+ .cse117 1)) (< c_~max1~0 .cse117) (< c_~max3~0 .cse116) (< c_~max2~0 (select .cse118 c_~A~0.offset)) (< c_~max2~0 (select .cse118 .cse4))))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse122 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse119 (select .cse122 .cse7)) (.cse120 (select .cse122 .cse4)) (.cse121 (select .cse122 c_~A~0.offset))) (or (< .cse119 .cse1) (= .cse120 c_~max1~0) (< c_~max1~0 .cse120) (< .cse120 (+ .cse121 1)) (< .cse120 .cse119) (< .cse120 (select .cse122 .cse6)) (< .cse121 .cse5))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse124 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse123 (select .cse124 .cse7)) (.cse125 (select .cse124 .cse6))) (or (< c_~max2~0 .cse123) (< c_~max1~0 (select .cse124 .cse4)) (= .cse123 c_~max2~0) (< c_~max1~0 (select .cse124 c_~A~0.offset)) (< .cse125 .cse12) (< .cse123 (+ .cse125 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse128 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse127 (select .cse128 .cse7)) (.cse126 (select .cse128 .cse6))) (or (< .cse126 .cse5) (< .cse127 .cse1) (= c_~max1~0 .cse126) (< .cse126 .cse127) (< c_~max1~0 .cse126) (< c_~max2~0 (select .cse128 c_~A~0.offset)) (< c_~max2~0 (select .cse128 .cse4)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse133 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse129 (select .cse133 .cse7)) (.cse130 (select .cse133 .cse4)) (.cse131 (select .cse133 c_~A~0.offset)) (.cse132 (select .cse133 .cse6))) (or (< .cse129 .cse1) (< .cse130 (+ .cse131 1)) (= c_~max1~0 .cse132) (< .cse132 .cse129) (< .cse132 (+ .cse130 1)) (< .cse131 .cse5) (< c_~max1~0 .cse132))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse138 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse135 (select .cse138 .cse4)) (.cse134 (select .cse138 .cse7)) (.cse137 (select .cse138 .cse6)) (.cse136 (select .cse138 c_~A~0.offset))) (or (< c_~max2~0 .cse134) (= .cse134 c_~max2~0) (< .cse135 (+ .cse136 1)) (< .cse137 (+ .cse135 1)) (< .cse134 (+ .cse137 1)) (< .cse136 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse142 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse140 (select .cse142 .cse6)) (.cse141 (select .cse142 .cse4)) (.cse139 (select .cse142 .cse7))) (or (< c_~max1~0 .cse139) (< .cse139 .cse1) (< .cse140 (+ .cse141 1)) (< .cse139 (+ .cse140 1)) (< .cse141 .cse5) (< c_~max2~0 (select .cse142 c_~A~0.offset)) (= c_~max1~0 .cse139))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse145 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse143 (select .cse145 .cse7)) (.cse144 (select .cse145 .cse4))) (or (< .cse143 .cse1) (= .cse144 c_~max1~0) (< c_~max1~0 .cse144) (< .cse144 .cse143) (< .cse144 (select .cse145 .cse6)) (< .cse144 .cse5) (< c_~max2~0 (select .cse145 c_~A~0.offset)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse148 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse147 (select .cse148 .cse4)) (.cse146 (select .cse148 .cse7)) (.cse149 (select .cse148 .cse6))) (or (< c_~max2~0 .cse146) (= .cse146 c_~max2~0) (< .cse147 .cse12) (< c_~max1~0 (select .cse148 c_~A~0.offset)) (< .cse149 (+ .cse147 1)) (< .cse146 (+ .cse149 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse152 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse150 (select .cse152 .cse7)) (.cse151 (select .cse152 .cse4))) (or (< c_~max2~0 .cse150) (< .cse150 (+ .cse151 1)) (= .cse150 c_~max2~0) (< .cse151 .cse12) (< c_~max1~0 (select .cse152 c_~A~0.offset)) (< .cse151 (select .cse152 .cse6)))))) (or (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse157 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse153 (select .cse157 .cse7)) (.cse155 (select .cse157 .cse6)) (.cse156 (select .cse157 c_~A~0.offset)) (.cse154 (select .cse157 .cse4))) (or (< c_~max1~0 .cse153) (< c_~max2~0 .cse153) (< .cse153 .cse1) (< c_~max1~0 .cse154) (< c_~max2~0 .cse155) (< c_~max1~0 .cse156) (< c_~max1~0 .cse155) (< c_~max2~0 .cse156) (< c_~max2~0 .cse154))))) .cse158) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse161 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse159 (select .cse161 .cse6)) (.cse160 (select .cse161 .cse4))) (or (< .cse159 c_~max3~0) (= c_~max1~0 .cse159) (< .cse159 (+ .cse160 1)) (< c_~max1~0 .cse159) (< c_~max3~0 (select .cse161 .cse7)) (< .cse160 .cse5) (< c_~max2~0 (select .cse161 c_~A~0.offset)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse164 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse162 (select .cse164 .cse6)) (.cse163 (select .cse164 .cse4))) (or (< c_~max3~0 (+ .cse162 1)) (< .cse163 .cse12) (< c_~max1~0 (select .cse164 c_~A~0.offset)) (< .cse162 (select .cse164 .cse7)) (< .cse162 (+ .cse163 1)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse167 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse165 (select .cse167 .cse7)) (.cse166 (select .cse167 c_~A~0.offset))) (or (< .cse165 (+ .cse166 1)) (< .cse166 (select .cse167 .cse4)) (= .cse165 c_~max3~0) (< .cse166 (select .cse167 .cse6)) (< c_~max3~0 .cse165) (< .cse166 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse170 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse169 (select .cse170 .cse6)) (.cse168 (select .cse170 .cse7))) (or (< c_~max1~0 .cse168) (< .cse169 .cse5) (< .cse168 .cse1) (< .cse168 (+ .cse169 1)) (< c_~max2~0 (select .cse170 c_~A~0.offset)) (= c_~max1~0 .cse168) (< c_~max2~0 (select .cse170 .cse4)))))) (or (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse174 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse172 (select .cse174 .cse4)) (.cse173 (select .cse174 c_~A~0.offset)) (.cse171 (select .cse174 .cse7))) (or (< c_~max1~0 .cse171) (< c_~max1~0 .cse172) (< .cse172 (+ .cse173 1)) (< .cse172 (select .cse174 .cse6)) (< c_~max3~0 (+ .cse172 1)) (< .cse173 .cse5) (< c_~max3~0 .cse171))))) .cse36) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse177 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse176 (select .cse177 c_~A~0.offset)) (.cse178 (select .cse177 .cse6)) (.cse175 (select .cse177 .cse7))) (or (< c_~max1~0 .cse175) (< .cse175 .cse1) (< .cse176 (select .cse177 .cse4)) (< .cse178 (+ .cse176 1)) (< .cse176 .cse5) (< .cse175 (+ .cse178 1)) (= c_~max1~0 .cse175))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse183 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse180 (select .cse183 .cse4)) (.cse181 (select .cse183 c_~A~0.offset)) (.cse182 (select .cse183 .cse6)) (.cse179 (select .cse183 .cse7))) (or (< c_~max1~0 .cse179) (< .cse179 .cse1) (< .cse180 (+ .cse181 1)) (< .cse182 (+ .cse180 1)) (< .cse181 .cse5) (< .cse179 (+ .cse182 1)) (= c_~max1~0 .cse179))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse187 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse185 (select .cse187 .cse4)) (.cse186 (select .cse187 c_~A~0.offset)) (.cse184 (select .cse187 .cse7))) (or (< c_~max1~0 .cse184) (< .cse184 .cse1) (< .cse184 (+ .cse185 1)) (< .cse185 (+ .cse186 1)) (< .cse185 (select .cse187 .cse6)) (< .cse186 .cse5) (= c_~max1~0 .cse184))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse192 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse188 (select .cse192 .cse4)) (.cse190 (select .cse192 .cse6)) (.cse191 (select .cse192 .cse7)) (.cse189 (select .cse192 c_~A~0.offset))) (or (< .cse188 (+ .cse189 1)) (< .cse190 (+ .cse188 1)) (= .cse191 c_~max3~0) (< .cse191 (+ .cse190 1)) (< c_~max3~0 .cse191) (< .cse189 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse194 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse193 (select .cse194 c_~A~0.offset))) (or (< .cse193 (select .cse194 .cse4)) (< .cse193 (select .cse194 .cse7)) (< .cse193 (select .cse194 .cse6)) (< c_~max2~0 .cse193) (= .cse193 c_~max2~0) (< .cse193 .cse12))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse195 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse196 (select .cse195 .cse6))) (or (< c_~max1~0 (select .cse195 .cse4)) (< c_~max2~0 .cse196) (= .cse196 c_~max2~0) (< c_~max1~0 (select .cse195 c_~A~0.offset)) (< .cse196 .cse12) (< .cse196 (select .cse195 .cse7)))))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse200 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse197 (select .cse200 .cse6)) (.cse198 (select .cse200 .cse4)) (.cse199 (select .cse200 c_~A~0.offset))) (or (< c_~max3~0 (+ .cse197 1)) (< .cse198 (+ .cse199 1)) (< .cse197 (select .cse200 .cse7)) (< .cse197 (+ .cse198 1)) (< .cse199 .cse12))))) (or .cse36 (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse205 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse203 (select .cse205 .cse4)) (.cse204 (select .cse205 c_~A~0.offset)) (.cse202 (select .cse205 .cse6)) (.cse201 (select .cse205 .cse7))) (or (< c_~max1~0 .cse201) (< c_~max3~0 (+ .cse202 1)) (< .cse203 (+ .cse204 1)) (< .cse202 (+ .cse203 1)) (< .cse204 .cse5) (< c_~max1~0 .cse202) (< c_~max3~0 .cse201)))))) (or (and (or .cse158 (< c_~max2~0 c_~max3~0)) (or .cse36 (< c_~max3~0 .cse5))) (forall ((v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse210 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) c_~A~0.base))) (let ((.cse208 (select .cse210 .cse6)) (.cse206 (select .cse210 .cse7)) (.cse209 (select .cse210 c_~A~0.offset)) (.cse207 (select .cse210 .cse4))) (or (< c_~max1~0 .cse206) (< c_~max1~0 .cse207) (< c_~max2~0 .cse208) (< c_~max1~0 .cse209) (< c_~max1~0 .cse208) (< c_~max3~0 .cse206) (< c_~max2~0 .cse209) (< c_~max2~0 .cse207))))))))) is different from false [2024-01-26 01:44:25,969 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse211 (* c_~N~0 4))) (let ((.cse57 (= c_~max1~0 c_~max2~0)) (.cse15 (+ c_~max1~0 1)) (.cse11 (+ c_~max3~0 1)) (.cse19 (= c_~max1~0 c_~max3~0)) (.cse5 (+ c_~max2~0 1)) (.cse6 (+ .cse211 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (- 8))) (.cse7 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse3 (+ .cse211 (- 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse2 .cse7)) (.cse4 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse0 (select .cse2 .cse6))) (or (< .cse0 (+ .cse1 1)) (< c_~max3~0 (select .cse2 .cse3)) (< .cse4 .cse5) (< .cse0 c_~max3~0) (< .cse1 (+ .cse4 1)) (= .cse0 c_~max1~0) (< c_~max1~0 .cse0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse10 (select .cse9 .cse3)) (.cse8 (select .cse9 .cse6))) (or (< .cse8 .cse5) (< c_~max2~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse10 .cse11) (< .cse8 .cse10) (= .cse8 c_~max1~0) (< c_~max1~0 .cse8) (< c_~max2~0 (select .cse9 .cse7)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (select .cse14 .cse6))) (or (< c_~max2~0 .cse12) (< .cse13 (select .cse14 .cse7)) (< .cse13 .cse15) (< .cse12 (+ .cse13 1)) (= .cse12 c_~max2~0) (< .cse12 (select .cse14 .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse16 (select .cse17 .cse7)) (.cse18 (select .cse17 .cse3))) (or (< .cse16 (select .cse17 .cse6)) (< .cse18 (+ .cse16 1)) (< .cse16 .cse5) (< c_~max2~0 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 .cse18) (< .cse18 .cse11) (= c_~max1~0 .cse18))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse20 (select .cse22 .cse3)) (.cse21 (select .cse22 .cse6))) (or (< c_~max3~0 .cse20) (< .cse21 .cse5) (< c_~max2~0 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max3~0 (+ .cse21 1)) (< c_~max1~0 .cse20) (< c_~max1~0 .cse21) (< c_~max2~0 (select .cse22 .cse7))))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse24 (select .cse26 .cse6)) (.cse25 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse23 (select .cse26 .cse3))) (or (< .cse23 (+ .cse24 1)) (< .cse25 (select .cse26 .cse7)) (< .cse25 .cse5) (< .cse24 (+ .cse25 1)) (< c_~max1~0 .cse23) (< .cse23 .cse11) (= c_~max1~0 .cse23))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse28 (select .cse30 .cse6)) (.cse29 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse27 (select .cse30 .cse3))) (or (< .cse27 (+ .cse28 1)) (= c_~max2~0 .cse27) (< .cse29 (select .cse30 .cse7)) (< .cse29 .cse15) (< .cse28 (+ .cse29 1)) (< c_~max2~0 .cse27))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse32 (select .cse33 .cse7)) (.cse31 (select .cse33 .cse6))) (or (< c_~max2~0 .cse31) (< .cse31 (+ .cse32 1)) (< .cse32 .cse15) (< c_~max1~0 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= .cse31 c_~max2~0) (< .cse31 (select .cse33 .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse35 (select .cse38 .cse6)) (.cse36 (select .cse38 .cse7)) (.cse37 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse34 (select .cse38 .cse3))) (or (< .cse34 (+ .cse35 1)) (< .cse35 (+ .cse36 1)) (= c_~max2~0 .cse34) (< .cse37 .cse15) (< .cse36 (+ .cse37 1)) (< c_~max2~0 .cse34))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse39 (select .cse40 .cse7))) (or (< .cse39 (select .cse40 .cse6)) (< .cse39 .cse5) (= .cse39 c_~max1~0) (< c_~max3~0 (select .cse40 .cse3)) (< c_~max1~0 .cse39) (< c_~max2~0 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse39 c_~max3~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse43 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse42 (select .cse43 .cse7)) (.cse41 (select .cse43 .cse6))) (or (< .cse41 (+ .cse42 1)) (< .cse42 .cse5) (< c_~max3~0 (select .cse43 .cse3)) (< .cse41 c_~max3~0) (< c_~max2~0 (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= .cse41 c_~max1~0) (< c_~max1~0 .cse41))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse44 (select .cse45 .cse7)) (.cse46 (select .cse45 .cse3))) (or (< .cse44 (select .cse45 .cse6)) (< .cse46 (+ .cse44 1)) (< .cse44 .cse15) (< c_~max3~0 .cse46) (= .cse46 c_~max3~0) (< c_~max1~0 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse49 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse48 (select .cse49 .cse7)) (.cse50 (select .cse49 .cse3)) (.cse47 (select .cse49 .cse6))) (or (< .cse47 (+ .cse48 1)) (< .cse48 .cse5) (< c_~max2~0 (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse50 .cse11) (< .cse47 .cse50) (= .cse47 c_~max1~0) (< c_~max1~0 .cse47))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse52 (select .cse54 .cse7)) (.cse53 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse51 (select .cse54 .cse6))) (or (< .cse51 (+ .cse52 1)) (< .cse53 .cse15) (< c_~max3~0 (+ .cse51 1)) (< .cse52 (+ .cse53 1)) (< .cse51 (select .cse54 .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse55 (select .cse56 .cse6))) (or (< .cse55 .cse15) (< c_~max1~0 (select .cse56 .cse7)) (< c_~max3~0 (+ .cse55 1)) (< c_~max1~0 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse55 (select .cse56 .cse3)))))) (or .cse57 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse62 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse60 (select .cse62 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse58 (select .cse62 .cse6)) (.cse61 (select .cse62 .cse3)) (.cse59 (select .cse62 .cse7))) (or (< c_~max2~0 .cse58) (< c_~max1~0 .cse59) (< c_~max2~0 .cse60) (< c_~max1~0 .cse60) (< c_~max1~0 .cse61) (< .cse61 .cse11) (< c_~max1~0 .cse58) (< c_~max2~0 .cse61) (< c_~max2~0 .cse59)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse67 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse64 (select .cse67 .cse6)) (.cse65 (select .cse67 .cse7)) (.cse66 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse63 (select .cse67 .cse3))) (or (< .cse63 (+ .cse64 1)) (< .cse64 (+ .cse65 1)) (< .cse66 .cse5) (< c_~max1~0 .cse63) (< .cse65 (+ .cse66 1)) (< .cse63 .cse11) (= c_~max1~0 .cse63))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse68 (select .cse69 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse68 (select .cse69 .cse3)) (< c_~max3~0 (+ .cse68 1)) (< .cse68 (select .cse69 .cse7)) (< .cse68 .cse15) (< .cse68 (select .cse69 .cse6)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse71 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse72 (select .cse71 .cse3)) (.cse70 (select .cse71 .cse7)) (.cse73 (select .cse71 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse70 (select .cse71 .cse6)) (< .cse72 (+ .cse70 1)) (< c_~max3~0 .cse72) (= .cse72 c_~max3~0) (< .cse73 .cse15) (< .cse70 (+ .cse73 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse78 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse75 (select .cse78 .cse6)) (.cse74 (select .cse78 .cse3)) (.cse76 (select .cse78 .cse7)) (.cse77 (select .cse78 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse74 (+ .cse75 1)) (< .cse75 (+ .cse76 1)) (< c_~max3~0 .cse74) (= .cse74 c_~max3~0) (< .cse77 .cse15) (< .cse76 (+ .cse77 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse81 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse80 (select .cse81 .cse6)) (.cse79 (select .cse81 .cse3))) (or (< .cse79 (+ .cse80 1)) (< .cse80 .cse5) (< c_~max2~0 (select .cse81 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 .cse79) (< .cse79 .cse11) (= c_~max1~0 .cse79) (< c_~max2~0 (select .cse81 .cse7)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse83 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse82 (select .cse83 .cse7))) (or (< .cse82 (select .cse83 .cse6)) (= .cse82 c_~max2~0) (< .cse82 (select .cse83 .cse3)) (< .cse84 .cse15) (< .cse82 (+ .cse84 1)) (< c_~max2~0 .cse82))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse86 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse85 (select .cse86 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse87 (select .cse86 .cse6))) (or (< .cse85 (select .cse86 .cse7)) (< .cse85 .cse15) (< .cse87 (+ .cse85 1)) (< c_~max3~0 (+ .cse87 1)) (< .cse87 (select .cse86 .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse89 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse88 (select .cse89 .cse7))) (or (< .cse88 (select .cse89 .cse6)) (= .cse88 c_~max1~0) (< c_~max3~0 (select .cse89 .cse3)) (< c_~max1~0 .cse88) (< .cse90 .cse5) (< .cse88 (+ .cse90 1)) (< .cse88 c_~max3~0))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse92 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse93 (select .cse92 .cse3)) (.cse91 (select .cse92 .cse7)) (.cse94 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse91 (select .cse92 .cse6)) (< c_~max3~0 (+ .cse91 1)) (< c_~max3~0 .cse93) (< c_~max1~0 .cse91) (< .cse94 .cse5) (< c_~max1~0 .cse93) (< .cse91 (+ .cse94 1))))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse97 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse96 (select .cse97 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse95 (select .cse97 .cse3))) (or (< .cse95 (+ .cse96 1)) (< .cse96 (select .cse97 .cse7)) (< .cse96 .cse5) (< c_~max1~0 .cse95) (< .cse96 (select .cse97 .cse6)) (< .cse95 .cse11) (= c_~max1~0 .cse95))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse100 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse99 (select .cse100 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse98 (select .cse100 .cse3))) (or (= c_~max2~0 .cse98) (< .cse98 (+ .cse99 1)) (< .cse99 (select .cse100 .cse7)) (< .cse99 .cse15) (< .cse99 (select .cse100 .cse6)) (< c_~max2~0 .cse98))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse101 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse102 (select .cse101 .cse3))) (or (< c_~max2~0 (select .cse101 .cse6)) (< c_~max2~0 (select .cse101 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 .cse102) (< .cse102 .cse11) (= c_~max1~0 .cse102) (< .cse102 .cse5) (< c_~max2~0 (select .cse101 .cse7)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse104 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse103 (select .cse104 .cse3))) (or (< .cse103 .cse15) (< c_~max3~0 .cse103) (< c_~max1~0 (select .cse104 .cse7)) (= .cse103 c_~max3~0) (< c_~max1~0 (select .cse104 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 (select .cse104 .cse6)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse106 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse105 (select .cse106 .cse7)) (.cse107 (select .cse106 .cse3))) (or (< .cse105 (select .cse106 .cse6)) (= c_~max2~0 .cse107) (< .cse107 (+ .cse105 1)) (< .cse105 .cse15) (< c_~max1~0 (select .cse106 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max2~0 .cse107))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse111 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse109 (select .cse111 .cse6)) (.cse110 (select .cse111 .cse7)) (.cse108 (select .cse111 .cse3))) (or (< .cse108 (+ .cse109 1)) (< .cse109 (+ .cse110 1)) (= c_~max2~0 .cse108) (< .cse110 .cse15) (< c_~max1~0 (select .cse111 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max2~0 .cse108))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse114 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse112 (select .cse114 .cse3)) (.cse113 (select .cse114 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse112 (+ .cse113 1)) (< c_~max3~0 .cse112) (< .cse113 (select .cse114 .cse7)) (= .cse112 c_~max3~0) (< .cse113 .cse15) (< .cse113 (select .cse114 .cse6)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse118 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse116 (select .cse118 .cse7)) (.cse117 (select .cse118 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse115 (select .cse118 .cse6))) (or (< c_~max2~0 .cse115) (< .cse115 (+ .cse116 1)) (< .cse117 .cse15) (< .cse116 (+ .cse117 1)) (= .cse115 c_~max2~0) (< .cse115 (select .cse118 .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse120 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse119 (select .cse120 .cse7)) (.cse121 (select .cse120 .cse3))) (or (< .cse119 (select .cse120 .cse6)) (< .cse119 .cse5) (= .cse119 c_~max1~0) (< .cse119 .cse121) (< c_~max1~0 .cse119) (< c_~max2~0 (select .cse120 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse121 .cse11))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse125 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse123 (select .cse125 .cse7)) (.cse124 (select .cse125 .cse3)) (.cse122 (select .cse125 .cse6))) (or (< .cse122 (+ .cse123 1)) (< .cse123 .cse5) (< c_~max3~0 .cse124) (< c_~max2~0 (select .cse125 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max3~0 (+ .cse122 1)) (< c_~max1~0 .cse124) (< c_~max1~0 .cse122)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse126 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse127 (select .cse126 .cse6))) (or (< c_~max3~0 (select .cse126 .cse3)) (< .cse127 .cse5) (< .cse127 c_~max3~0) (< c_~max2~0 (select .cse126 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= .cse127 c_~max1~0) (< c_~max1~0 .cse127) (< c_~max2~0 (select .cse126 .cse7)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse132 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse129 (select .cse132 .cse7)) (.cse130 (select .cse132 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse131 (select .cse132 .cse3)) (.cse128 (select .cse132 .cse6))) (or (< .cse128 (+ .cse129 1)) (< .cse130 .cse5) (< .cse129 (+ .cse130 1)) (< .cse131 .cse11) (< .cse128 .cse131) (= .cse128 c_~max1~0) (< c_~max1~0 .cse128))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse136 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse133 (select .cse136 .cse3)) (.cse134 (select .cse136 .cse6)) (.cse135 (select .cse136 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse133 (+ .cse134 1)) (< c_~max3~0 .cse133) (< .cse135 (select .cse136 .cse7)) (= .cse133 c_~max3~0) (< .cse135 .cse15) (< .cse134 (+ .cse135 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse138 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse137 (select .cse138 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse137 c_~max3~0) (< c_~max3~0 (select .cse138 .cse3)) (< .cse137 (select .cse138 .cse7)) (< .cse137 .cse5) (< c_~max1~0 .cse137) (< .cse137 (select .cse138 .cse6)) (= c_~max1~0 .cse137))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse140 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse139 (select .cse140 .cse6))) (or (< c_~max2~0 .cse139) (< .cse139 .cse15) (< c_~max1~0 (select .cse140 .cse7)) (< c_~max1~0 (select .cse140 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= .cse139 c_~max2~0) (< .cse139 (select .cse140 .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse142 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse141 (select .cse142 .cse7)) (.cse144 (select .cse142 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse143 (select .cse142 .cse3))) (or (< .cse141 (select .cse142 .cse6)) (= c_~max2~0 .cse143) (< .cse143 (+ .cse141 1)) (< .cse144 .cse15) (< .cse141 (+ .cse144 1)) (< c_~max2~0 .cse143))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse146 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse145 (select .cse146 .cse7)) (.cse148 (select .cse146 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse147 (select .cse146 .cse3))) (or (< .cse145 (select .cse146 .cse6)) (< .cse147 (+ .cse145 1)) (< .cse148 .cse5) (< c_~max1~0 .cse147) (< .cse145 (+ .cse148 1)) (< .cse147 .cse11) (= c_~max1~0 .cse147))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse150 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse149 (select .cse150 .cse3))) (or (= c_~max2~0 .cse149) (< .cse149 .cse15) (< c_~max1~0 (select .cse150 .cse7)) (< c_~max1~0 (select .cse150 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 (select .cse150 .cse6)) (< c_~max2~0 .cse149))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse153 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse152 (select .cse153 .cse6)) (.cse151 (select .cse153 .cse3))) (or (< .cse151 (+ .cse152 1)) (< c_~max3~0 .cse151) (< .cse152 .cse15) (< c_~max1~0 (select .cse153 .cse7)) (= .cse151 c_~max3~0) (< c_~max1~0 (select .cse153 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse156 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse155 (select .cse156 .cse7)) (.cse154 (select .cse156 .cse6))) (or (< .cse154 (+ .cse155 1)) (< .cse155 .cse15) (< c_~max3~0 (+ .cse154 1)) (< c_~max1~0 (select .cse156 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< .cse154 (select .cse156 .cse3)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse160 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse158 (select .cse160 .cse6)) (.cse159 (select .cse160 .cse7)) (.cse157 (select .cse160 .cse3))) (or (< .cse157 (+ .cse158 1)) (< .cse158 (+ .cse159 1)) (< .cse159 .cse5) (< c_~max2~0 (select .cse160 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 .cse157) (< .cse157 .cse11) (= c_~max1~0 .cse157))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse163 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse162 (select .cse163 .cse6)) (.cse161 (select .cse163 .cse3))) (or (< .cse161 (+ .cse162 1)) (= c_~max2~0 .cse161) (< .cse162 .cse15) (< c_~max1~0 (select .cse163 .cse7)) (< c_~max1~0 (select .cse163 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max2~0 .cse161))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse165 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse164 (select .cse165 .cse7))) (or (< .cse164 (select .cse165 .cse6)) (= .cse164 c_~max2~0) (< .cse164 .cse15) (< .cse164 (select .cse165 .cse3)) (< c_~max1~0 (select .cse165 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max2~0 .cse164))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse168 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse166 (select .cse168 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse167 (select .cse168 .cse3))) (or (< .cse166 .cse167) (< .cse166 (select .cse168 .cse7)) (< .cse166 .cse5) (< c_~max1~0 .cse166) (< .cse166 (select .cse168 .cse6)) (= c_~max1~0 .cse166) (< .cse167 .cse11))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse170 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse169 (select .cse170 .cse7)) (.cse172 (select .cse170 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse171 (select .cse170 .cse3))) (or (< .cse169 (select .cse170 .cse6)) (= .cse169 c_~max1~0) (< .cse169 .cse171) (< c_~max1~0 .cse169) (< .cse172 .cse5) (< .cse169 (+ .cse172 1)) (< .cse171 .cse11))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse174 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse173 (select .cse174 .cse7)) (.cse175 (select .cse174 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse173 (select .cse174 .cse6)) (< c_~max3~0 (+ .cse173 1)) (< .cse173 (select .cse174 .cse3)) (< .cse175 .cse15) (< .cse173 (+ .cse175 1)))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse177 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse176 (select .cse177 .cse7)) (.cse178 (select .cse177 .cse3))) (or (< .cse176 (select .cse177 .cse6)) (< c_~max3~0 (+ .cse176 1)) (< .cse176 .cse5) (< c_~max3~0 .cse178) (< c_~max1~0 .cse176) (< c_~max2~0 (select .cse177 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max1~0 .cse178)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse180 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse179 (select .cse180 .cse7))) (or (< .cse179 (select .cse180 .cse6)) (< c_~max3~0 (+ .cse179 1)) (< .cse179 .cse15) (< .cse179 (select .cse180 .cse3)) (< c_~max1~0 (select .cse180 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse182 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse181 (select .cse182 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse181 (select .cse182 .cse3)) (< .cse181 (select .cse182 .cse7)) (= .cse181 c_~max2~0) (< .cse181 .cse15) (< c_~max2~0 .cse181) (< .cse181 (select .cse182 .cse6)))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse185 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse184 (select .cse185 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse183 (select .cse185 .cse3)) (.cse186 (select .cse185 .cse6))) (or (< c_~max3~0 .cse183) (< .cse184 (select .cse185 .cse7)) (< .cse184 .cse5) (< .cse186 (+ .cse184 1)) (< c_~max3~0 (+ .cse186 1)) (< c_~max1~0 .cse183) (< c_~max1~0 .cse186)))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse189 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse188 (select .cse189 .cse3)) (.cse187 (select .cse189 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (+ .cse187 1)) (< c_~max3~0 .cse188) (< .cse187 (select .cse189 .cse7)) (< .cse187 .cse5) (< c_~max1~0 .cse187) (< c_~max1~0 .cse188) (< .cse187 (select .cse189 .cse6))))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse194 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse193 (select .cse194 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse191 (select .cse194 .cse3)) (.cse190 (select .cse194 .cse6)) (.cse192 (select .cse194 .cse7))) (or (< c_~max2~0 .cse190) (< c_~max3~0 .cse191) (< c_~max1~0 .cse192) (< c_~max2~0 .cse193) (< c_~max1~0 .cse193) (< c_~max1~0 .cse191) (< c_~max1~0 .cse190) (< c_~max2~0 .cse192))))) (and (or .cse57 (< c_~max2~0 c_~max3~0)) (or .cse19 (< c_~max3~0 .cse5)))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse198 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse196 (select .cse198 .cse6)) (.cse197 (select .cse198 .cse7)) (.cse195 (select .cse198 .cse3))) (or (< .cse195 (+ .cse196 1)) (< .cse196 (+ .cse197 1)) (< .cse197 .cse15) (< c_~max3~0 .cse195) (= .cse195 c_~max3~0) (< c_~max1~0 (select .cse198 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse200 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse199 (select .cse200 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse202 (select .cse200 .cse3)) (.cse201 (select .cse200 .cse6))) (or (< .cse199 (select .cse200 .cse7)) (< .cse199 .cse5) (< .cse201 (+ .cse199 1)) (< .cse202 .cse11) (< .cse201 .cse202) (= .cse201 c_~max1~0) (< c_~max1~0 .cse201))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse203 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse204 (select .cse203 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse205 (select .cse203 .cse6))) (or (< c_~max3~0 (select .cse203 .cse3)) (< .cse204 (select .cse203 .cse7)) (< .cse204 .cse5) (< .cse205 c_~max3~0) (< .cse205 (+ .cse204 1)) (= .cse205 c_~max1~0) (< c_~max1~0 .cse205))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse210 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse208 (select .cse210 .cse3)) (.cse207 (select .cse210 .cse7)) (.cse209 (select .cse210 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse206 (select .cse210 .cse6))) (or (< .cse206 (+ .cse207 1)) (< c_~max3~0 .cse208) (< .cse209 .cse5) (< c_~max3~0 (+ .cse206 1)) (< c_~max1~0 .cse208) (< .cse207 (+ .cse209 1)) (< c_~max1~0 .cse206))))))))) is different from false [2024-01-26 01:45:10,355 WARN L293 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:45:36,719 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 224 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:45:55,928 WARN L293 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 224 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:46:03,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:03,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 280 treesize of output 184 [2024-01-26 01:46:03,278 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:46:03,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2232 treesize of output 2120 [2024-01-26 01:46:03,467 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:03,467 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 535 treesize of output 363 [2024-01-26 01:46:04,809 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:04,810 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 497 treesize of output 415 [2024-01-26 01:46:04,948 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:04,949 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 407 treesize of output 370 [2024-01-26 01:46:07,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:07,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 165 [2024-01-26 01:46:07,661 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:46:07,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1951 treesize of output 1849 [2024-01-26 01:46:07,858 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:07,859 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 901 treesize of output 741 [2024-01-26 01:46:07,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:07,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:07,904 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:07,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:07,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 315 [2024-01-26 01:46:08,111 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:08,112 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 385 treesize of output 309 [2024-01-26 01:46:09,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:09,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 195 [2024-01-26 01:46:10,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:10,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2236 treesize of output 2138 [2024-01-26 01:46:10,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:10,289 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 1015 treesize of output 867 [2024-01-26 01:46:10,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:10,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 399 treesize of output 386 [2024-01-26 01:46:10,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:10,811 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 437 treesize of output 379 [2024-01-26 01:46:20,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 183 [2024-01-26 01:46:20,634 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:46:20,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2067 treesize of output 1951 [2024-01-26 01:46:20,796 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:20,797 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 481 treesize of output 301 [2024-01-26 01:46:21,474 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:21,474 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 440 treesize of output 354 [2024-01-26 01:46:21,610 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:21,610 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 346 treesize of output 307 [2024-01-26 01:46:23,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:23,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 156 [2024-01-26 01:46:23,646 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:23,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6794 treesize of output 6418 [2024-01-26 01:46:24,042 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:24,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 354 treesize of output 344 [2024-01-26 01:46:24,376 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:24,377 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 702 treesize of output 590 [2024-01-26 01:46:24,696 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:24,696 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 315 treesize of output 271 [2024-01-26 01:46:26,315 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:26,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 1 [2024-01-26 01:46:26,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:26,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 172 [2024-01-26 01:46:26,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:26,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7759 treesize of output 7343 [2024-01-26 01:46:26,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:26,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 421 treesize of output 415 [2024-01-26 01:46:27,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:27,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 648 treesize of output 528 [2024-01-26 01:46:27,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:27,448 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 380 treesize of output 336 [2024-01-26 01:46:30,917 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:30,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 1 [2024-01-26 01:46:30,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:30,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 133 [2024-01-26 01:46:31,251 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:46:31,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7327 treesize of output 6973 [2024-01-26 01:46:31,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:31,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:31,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:31,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:31,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 391 [2024-01-26 01:46:31,563 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:31,563 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 827 treesize of output 699 [2024-01-26 01:46:31,723 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:31,724 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 377 treesize of output 317 [2024-01-26 01:46:32,949 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:32,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 1 [2024-01-26 01:46:32,981 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:32,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 1 [2024-01-26 01:46:33,004 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:33,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 1 [2024-01-26 01:46:33,029 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:33,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 287 treesize of output 1 [2024-01-26 01:46:33,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:33,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 154 [2024-01-26 01:46:33,383 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:46:33,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2096 treesize of output 2000 [2024-01-26 01:46:33,591 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:33,592 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 1019 treesize of output 863 [2024-01-26 01:46:33,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:33,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:33,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:33,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:33,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 411 treesize of output 378 [2024-01-26 01:46:33,870 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:33,871 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 445 treesize of output 371 [2024-01-26 01:46:36,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:36,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 188 [2024-01-26 01:46:37,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:37,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5286 treesize of output 5058 [2024-01-26 01:46:37,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:37,495 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 629 treesize of output 567 [2024-01-26 01:46:37,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:37,710 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 535 treesize of output 520 [2024-01-26 01:46:42,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:42,375 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 667 treesize of output 511 [2024-01-26 01:46:43,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:43,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 180 [2024-01-26 01:46:43,415 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:43,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2168 treesize of output 2074 [2024-01-26 01:46:43,841 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:43,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 485 treesize of output 468 [2024-01-26 01:46:44,190 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:44,190 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 962 treesize of output 822 [2024-01-26 01:46:44,546 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:44,546 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 437 treesize of output 379 [2024-01-26 01:46:47,571 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:47,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 1 [2024-01-26 01:46:47,594 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:47,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 1 [2024-01-26 01:46:47,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:47,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 148 [2024-01-26 01:46:47,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:47,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6282 treesize of output 5962 [2024-01-26 01:46:48,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:48,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 348 [2024-01-26 01:46:48,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:48,421 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 682 treesize of output 602 [2024-01-26 01:46:48,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:48,667 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 311 treesize of output 287 [2024-01-26 01:46:50,668 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:50,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 1 [2024-01-26 01:46:50,693 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:50,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 1 [2024-01-26 01:46:50,715 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:50,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 1 [2024-01-26 01:46:50,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:50,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 156 [2024-01-26 01:46:50,970 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:46:50,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4332 treesize of output 4119 [2024-01-26 01:46:51,105 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:51,105 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:46:51,191 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 01:46:51,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 485 treesize of output 448 [2024-01-26 01:46:51,330 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-01-26 01:46:51,331 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 962 treesize of output 802 [2024-01-26 01:46:51,470 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-01-26 01:46:51,471 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 437 treesize of output 359 [2024-01-26 01:46:52,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:52,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 172 [2024-01-26 01:46:52,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:52,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2040 treesize of output 1966 [2024-01-26 01:46:53,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:53,091 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 977 treesize of output 939 [2024-01-26 01:46:53,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:53,353 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 907 treesize of output 799 [2024-01-26 01:46:53,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:53,614 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 398 treesize of output 395 [2024-01-26 01:46:58,160 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 1 [2024-01-26 01:46:58,181 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 1 [2024-01-26 01:46:58,203 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 1 [2024-01-26 01:46:58,226 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 1 [2024-01-26 01:46:58,261 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 1 [2024-01-26 01:46:58,284 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2024-01-26 01:46:58,308 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 1 [2024-01-26 01:46:58,332 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:46:58,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 1 [2024-01-26 01:46:58,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:58,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 157 [2024-01-26 01:46:58,813 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:46:58,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3711 treesize of output 3527 [2024-01-26 01:46:59,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:59,049 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 423 treesize of output 383 [2024-01-26 01:46:59,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:46:59,248 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 351 treesize of output 347 [2024-01-26 01:47:01,436 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:01,437 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 453 treesize of output 333 [2024-01-26 01:47:01,934 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:01,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 1 [2024-01-26 01:47:01,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:01,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 180 [2024-01-26 01:47:02,148 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:02,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1046 treesize of output 993 [2024-01-26 01:47:02,337 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:02,337 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 1005 treesize of output 841 [2024-01-26 01:47:02,558 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:02,559 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 785 treesize of output 707 [2024-01-26 01:47:02,740 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:02,741 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 361 treesize of output 326 [2024-01-26 01:47:04,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:04,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 160 [2024-01-26 01:47:04,484 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:04,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2020 treesize of output 1940 [2024-01-26 01:47:04,844 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:04,845 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 984 treesize of output 936 [2024-01-26 01:47:05,202 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:05,203 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 912 treesize of output 792 [2024-01-26 01:47:05,558 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:05,559 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 399 treesize of output 387 [2024-01-26 01:47:09,412 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:09,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 1 [2024-01-26 01:47:09,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:09,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 165 [2024-01-26 01:47:09,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:09,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9257 treesize of output 8841 [2024-01-26 01:47:10,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:10,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 561 treesize of output 553 [2024-01-26 01:47:10,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:10,375 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 1113 treesize of output 985 [2024-01-26 01:47:10,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:10,638 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 513 treesize of output 465 [2024-01-26 01:47:15,101 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 1 [2024-01-26 01:47:15,127 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 1 [2024-01-26 01:47:15,154 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2024-01-26 01:47:15,180 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 1 [2024-01-26 01:47:15,206 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 1 [2024-01-26 01:47:15,238 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 1 [2024-01-26 01:47:15,266 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 1 [2024-01-26 01:47:15,291 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 1 [2024-01-26 01:47:15,321 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 1 [2024-01-26 01:47:15,347 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 1 [2024-01-26 01:47:15,373 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 312 treesize of output 1 [2024-01-26 01:47:15,398 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 1 [2024-01-26 01:47:15,422 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 1 [2024-01-26 01:47:15,446 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 1 [2024-01-26 01:47:15,482 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 1 [2024-01-26 01:47:15,507 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2024-01-26 01:47:15,547 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 1 [2024-01-26 01:47:15,586 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 1 [2024-01-26 01:47:15,611 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 289 treesize of output 1 [2024-01-26 01:47:15,636 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 1 [2024-01-26 01:47:15,661 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 1 [2024-01-26 01:47:15,700 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 1 [2024-01-26 01:47:15,727 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:15,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 1 [2024-01-26 01:47:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-01-26 01:47:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475675894] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:47:28,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:47:28,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 53, 48] total 117 [2024-01-26 01:47:28,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749887913] [2024-01-26 01:47:28,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:47:28,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2024-01-26 01:47:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:47:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2024-01-26 01:47:28,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=12184, Unknown=56, NotChecked=454, Total=13572 [2024-01-26 01:47:28,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:47:28,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:47:28,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 4.222222222222222) internal successors, (494), 117 states have internal predecessors, (494), 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) [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-01-26 01:47:28,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:48:34,299 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification. DAG size of input: 421 DAG size of output: 208 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:48:52,965 WARN L293 SmtUtils]: Spent 10.12s on a formula simplification. DAG size of input: 423 DAG size of output: 210 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:49:07,118 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 425 DAG size of output: 210 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:49:24,257 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification. DAG size of input: 423 DAG size of output: 208 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:49:26,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 01:49:29,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 01:49:31,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 01:49:33,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 01:49:36,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 01:49:39,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 01:49:41,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 01:50:07,109 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 266 DAG size of output: 357 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-26 01:52:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-01-26 01:52:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-26 01:52:09,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:52:09,662 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:52:09,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:52:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash -423331473, now seen corresponding path program 4 times [2024-01-26 01:52:09,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:52:09,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947870902] [2024-01-26 01:52:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:52:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:52:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:52:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 30 proven. 107 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-01-26 01:52:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:52:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947870902] [2024-01-26 01:52:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947870902] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:52:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138832709] [2024-01-26 01:52:13,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 01:52:13,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:52:13,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:52:13,609 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:52:13,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-26 01:52:13,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 01:52:13,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:52:13,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 26 conjunts are in the unsatisfiable core [2024-01-26 01:52:13,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:52:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 85 proven. 96 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-01-26 01:52:25,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:52:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-01-26 01:52:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138832709] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:52:38,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:52:38,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 27] total 72 [2024-01-26 01:52:38,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702595600] [2024-01-26 01:52:38,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:52:38,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-01-26 01:52:38,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:52:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-01-26 01:52:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=591, Invalid=4521, Unknown=0, NotChecked=0, Total=5112 [2024-01-26 01:52:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:52:38,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:52:38,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 5.597222222222222) internal successors, (403), 72 states have internal predecessors, (403), 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) [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-01-26 01:52:38,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:53:40,371 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-01-26 01:53:40,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-01-26 01:53:40,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-26 01:53:40,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:53:40,572 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.createSuccessors(DynamicStratifiedReduction.java:400) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.traverse(DynamicStratifiedReduction.java:270) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.(DynamicStratifiedReduction.java:161) at de.uni_freiburg.informatik.ultimate.automata.partialorder.dynamicabstraction.DynamicStratifiedReduction.traverse(DynamicStratifiedReduction.java:204) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:389) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) 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.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) 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: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) 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) ... 46 more [2024-01-26 01:53:40,576 INFO L158 Benchmark]: Toolchain (without parser) took 735374.18ms. Allocated memory was 303.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 250.3MB in the beginning and 829.9MB in the end (delta: -579.6MB). Peak memory consumption was 466.9MB. Max. memory is 8.0GB. [2024-01-26 01:53:40,576 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 01:53:40,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.19ms. Allocated memory is still 303.0MB. Free memory was 250.3MB in the beginning and 238.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-01-26 01:53:40,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.27ms. Allocated memory is still 303.0MB. Free memory was 237.7MB in the beginning and 236.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-26 01:53:40,576 INFO L158 Benchmark]: Boogie Preprocessor took 19.68ms. Allocated memory is still 303.0MB. Free memory was 236.1MB in the beginning and 234.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:53:40,576 INFO L158 Benchmark]: RCFGBuilder took 520.40ms. Allocated memory is still 303.0MB. Free memory was 234.5MB in the beginning and 212.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-01-26 01:53:40,576 INFO L158 Benchmark]: TraceAbstraction took 734576.78ms. Allocated memory was 303.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 210.9MB in the beginning and 829.9MB in the end (delta: -618.9MB). Peak memory consumption was 428.1MB. Max. memory is 8.0GB. [2024-01-26 01:53:40,577 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.10ms. Allocated memory is still 198.2MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.19ms. Allocated memory is still 303.0MB. Free memory was 250.3MB in the beginning and 238.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.27ms. Allocated memory is still 303.0MB. Free memory was 237.7MB in the beginning and 236.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.68ms. Allocated memory is still 303.0MB. Free memory was 236.1MB in the beginning and 234.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.40ms. Allocated memory is still 303.0MB. Free memory was 234.5MB in the beginning and 212.0MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 734576.78ms. Allocated memory was 303.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 210.9MB in the beginning and 829.9MB in the end (delta: -618.9MB). Peak memory consumption was 428.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-01-26 01:53:40,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...