/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-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 01:42:16,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 01:42:16,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 01:42:16,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 01:42:16,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 01:42:16,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 01:42:16,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 01:42:16,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 01:42:16,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 01:42:16,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 01:42:16,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 01:42:16,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 01:42:16,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 01:42:16,686 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 01:42:16,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 01:42:16,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 01:42:16,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 01:42:16,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 01:42:16,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 01:42:16,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 01:42:16,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 01:42:16,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 01:42:16,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 01:42:16,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 01:42:16,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 01:42:16,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 01:42:16,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 01:42:16,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 01:42:16,692 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 01:42:16,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 01:42:16,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:42:16,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 01:42:16,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 01:42:16,694 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 01:42:16,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 01:42:16,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 01:42:16,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 01:42:16,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 01:42:16,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 01:42:16,695 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 01:42:16,695 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 01:42:16,695 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:42:16,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 01:42:16,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 01:42:16,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 01:42:16,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 01:42:16,950 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 01:42:16,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2024-01-26 01:42:18,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 01:42:18,367 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 01:42:18,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2024-01-26 01:42:18,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a075c7364/c0e7dd50bfcb44e2a3105c50c2010c34/FLAG2de443823 [2024-01-26 01:42:18,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a075c7364/c0e7dd50bfcb44e2a3105c50c2010c34 [2024-01-26 01:42:18,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 01:42:18,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 01:42:18,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 01:42:18,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 01:42:18,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 01:42:18,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136c446b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18, skipping insertion in model container [2024-01-26 01:42:18,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,426 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 01:42:18,608 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2024-01-26 01:42:18,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:42:18,626 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 01:42:18,643 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-min-array-hom.wvr.c[2625,2638] [2024-01-26 01:42:18,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:42:18,659 INFO L206 MainTranslator]: Completed translation [2024-01-26 01:42:18,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18 WrapperNode [2024-01-26 01:42:18,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 01:42:18,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 01:42:18,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 01:42:18,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 01:42:18,667 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:42:18" (1/1) ... [2024-01-26 01:42:18,673 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:42:18" (1/1) ... [2024-01-26 01:42:18,708 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2024-01-26 01:42:18,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 01:42:18,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 01:42:18,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 01:42:18,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 01:42:18,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,729 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 01:42:18,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 01:42:18,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 01:42:18,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 01:42:18,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (1/1) ... [2024-01-26 01:42:18,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:42:18,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:18,785 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:42:18,810 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:42:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 01:42:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 01:42:18,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 01:42:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 01:42:18,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 01:42:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 01:42:18,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 01:42:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 01:42:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 01:42:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 01:42:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 01:42:18,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 01:42:18,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 01:42:18,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 01:42:18,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 01:42:18,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 01:42:18,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 01:42:18,818 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:42:18,934 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 01:42:18,935 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 01:42:19,198 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 01:42:19,257 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 01:42:19,257 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 01:42:19,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:42:19 BoogieIcfgContainer [2024-01-26 01:42:19,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 01:42:19,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 01:42:19,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 01:42:19,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 01:42:19,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 01:42:18" (1/3) ... [2024-01-26 01:42:19,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241750d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:42:19, skipping insertion in model container [2024-01-26 01:42:19,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:42:18" (2/3) ... [2024-01-26 01:42:19,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241750d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:42:19, skipping insertion in model container [2024-01-26 01:42:19,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:42:19" (3/3) ... [2024-01-26 01:42:19,269 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2024-01-26 01:42:19,277 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 01:42:19,286 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 01:42:19,286 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 01:42:19,287 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 01:42:19,362 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-26 01:42:19,411 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:42:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 01:42:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:19,413 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:42:19,429 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:42:19,467 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 01:42:19,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 01:42:19,480 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;@578e48ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:42:19,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 01:42:19,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:19,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1811752127, now seen corresponding path program 1 times [2024-01-26 01:42:19,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:19,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379748717] [2024-01-26 01:42:19,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:20,273 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:42:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:20,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379748717] [2024-01-26 01:42:20,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379748717] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:42:20,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 01:42:20,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 01:42:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852343082] [2024-01-26 01:42:20,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:42:20,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 01:42:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:42:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 01:42:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 01:42:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:20,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:42:20,306 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:42:20,306 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:42:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:20,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 01:42:20,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:20,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1173572647, now seen corresponding path program 1 times [2024-01-26 01:42:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138624097] [2024-01-26 01:42:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:21,000 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:42:21,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138624097] [2024-01-26 01:42:21,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138624097] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061788771] [2024-01-26 01:42:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:21,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:42:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:21,046 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:42:21,063 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:42:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:21,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 01:42:21,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:42:21,373 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:42:21,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:42:21,584 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:42:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061788771] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:21,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 01:42:21,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-01-26 01:42:21,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179233780] [2024-01-26 01:42:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:42:21,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 01:42:21,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:42:21,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 01:42:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-01-26 01:42:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:21,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:42:21,589 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:42:21,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:21,590 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:42:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:21,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:21,737 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:42:21,935 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:42:21,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:21,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1296617505, now seen corresponding path program 1 times [2024-01-26 01:42:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315687844] [2024-01-26 01:42:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:22,222 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:42:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315687844] [2024-01-26 01:42:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315687844] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572260217] [2024-01-26 01:42:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:42:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:22,225 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:42:22,242 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:42:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:22,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-26 01:42:22,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:42:22,599 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:42:22,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:42:22,860 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:42:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572260217] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:42:22,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:42:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2024-01-26 01:42:22,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115241052] [2024-01-26 01:42:22,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:42:22,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-26 01:42:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:42:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-26 01:42:22,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-01-26 01:42:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:22,865 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:42:22,865 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:42:22,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:22,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:22,865 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:42:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:23,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-26 01:42:24,193 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:42:24,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:24,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:24,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2034078778, now seen corresponding path program 1 times [2024-01-26 01:42:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:24,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182553021] [2024-01-26 01:42:24,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:24,529 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:42:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:24,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182553021] [2024-01-26 01:42:24,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182553021] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809594357] [2024-01-26 01:42:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:24,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:42:24,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:24,531 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:42:24,558 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:42:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:24,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-26 01:42:24,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:42:24,927 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:42:24,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:42:25,319 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:42:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809594357] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:42:25,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:42:25,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2024-01-26 01:42:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447405803] [2024-01-26 01:42:25,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:42:25,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-01-26 01:42:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:42:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-01-26 01:42:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2024-01-26 01:42:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:25,323 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:42:25,323 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:42:25,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:25,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:25,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:25,324 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:42:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:42:27,568 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:42:27,765 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:42:27,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:27,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1657802065, now seen corresponding path program 2 times [2024-01-26 01:42:27,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:27,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783651491] [2024-01-26 01:42:27,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:27,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:28,177 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:42:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783651491] [2024-01-26 01:42:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783651491] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7685895] [2024-01-26 01:42:28,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 01:42:28,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:42:28,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:28,180 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:42:28,206 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:42:28,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-26 01:42:28,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:42:28,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-26 01:42:28,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:42:28,607 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:42:28,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-26 01:42:28,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7685895] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:42:28,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-26 01:42:28,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-01-26 01:42:28,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407778426] [2024-01-26 01:42:28,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:42:28,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 01:42:28,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:42:28,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 01:42:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2024-01-26 01:42:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:28,614 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:42:28,615 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:42:28,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:28,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:28,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:28,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:42:28,615 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:42:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:42:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:42:29,631 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:42:29,826 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:42:29,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:29,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash -740306392, now seen corresponding path program 1 times [2024-01-26 01:42:29,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:29,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261853340] [2024-01-26 01:42:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:30,244 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:42:30,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261853340] [2024-01-26 01:42:30,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261853340] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:30,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269598403] [2024-01-26 01:42:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:30,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:42:30,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:30,247 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:42:30,268 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:42:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:30,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 18 conjunts are in the unsatisfiable core [2024-01-26 01:42:30,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:42:30,776 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:42:30,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:42:31,269 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:42:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269598403] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:42:31,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:42:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2024-01-26 01:42:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13238156] [2024-01-26 01:42:31,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:42:31,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-01-26 01:42:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:42:31,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-01-26 01:42:31,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2024-01-26 01:42:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:31,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:42:31,273 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:42:31,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:31,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:31,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:31,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:42:31,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:42:31,273 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:42:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:42:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:42:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:42:32,740 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:42:32,936 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:42:32,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:32,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash -592593564, now seen corresponding path program 2 times [2024-01-26 01:42:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444454627] [2024-01-26 01:42:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:33,511 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:42:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444454627] [2024-01-26 01:42:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444454627] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668481826] [2024-01-26 01:42:33,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 01:42:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:42:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:33,514 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:42:33,537 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:42:33,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 01:42:33,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:42:33,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2024-01-26 01:42:33,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:42:34,188 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:42:34,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:42:34,742 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:42:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668481826] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:42:34,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:42:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2024-01-26 01:42:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682202053] [2024-01-26 01:42:34,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:42:34,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-01-26 01:42:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:42:34,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-01-26 01:42:34,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2024-01-26 01:42:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:34,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:42:34,747 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:42:34,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:34,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:34,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:34,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:42:34,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:42:34,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:42:34,747 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:42:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:42:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:42:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:42:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:42:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:42:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:42:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-01-26 01:42:38,302 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:42:38,497 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:42:38,497 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:42:38,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:42:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash 807880481, now seen corresponding path program 3 times [2024-01-26 01:42:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:42:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997260257] [2024-01-26 01:42:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:42:38,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:42:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:42:39,077 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:42:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:42:39,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997260257] [2024-01-26 01:42:39,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997260257] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:42:39,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235469791] [2024-01-26 01:42:39,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 01:42:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:42:39,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:42:39,080 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:42:39,100 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:42:39,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-01-26 01:42:39,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:42:39,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 88 conjunts are in the unsatisfiable core [2024-01-26 01:42:39,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:42:40,695 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:42:41,194 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:41,289 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:41,379 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:59,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 01:42:59,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:42:59,952 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 1016 treesize of output 500 [2024-01-26 01:43:18,741 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:43:18,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:45:45,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse217 (* c_~N~0 4))) (let ((.cse60 (= c_~min2~0 c_~min1~0)) (.cse19 (= c_~min1~0 c_~min3~0)) (.cse7 (+ c_~min3~0 1)) (.cse4 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse3 (+ .cse217 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (- 8))) (.cse2 (+ .cse217 (- 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 ((.cse1 (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 ((.cse0 (select .cse1 .cse4))) (or (= c_~min1~0 .cse0) (< .cse0 c_~min1~0) (< (select .cse1 .cse2) c_~min3~0) (< c_~min3~0 .cse0) (< (select .cse1 .cse3) .cse0) (< c_~min2~0 (+ .cse0 1)) (< (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse8 (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 ((.cse5 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (select .cse8 .cse4))) (or (< c_~min1~0 (+ .cse5 1)) (< .cse5 (+ .cse6 1)) (< .cse6 .cse7) (< (select .cse8 .cse3) .cse6) (< (select .cse8 .cse2) .cse6))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse10 (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 ((.cse9 (select .cse10 .cse4))) (or (< .cse9 .cse7) (< (select .cse10 .cse3) .cse9) (< (select .cse10 .cse2) .cse9) (< (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< c_~min1~0 (+ .cse9 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse13 (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 ((.cse11 (select .cse13 .cse2)) (.cse12 (select .cse13 .cse4))) (or (= c_~min3~0 .cse11) (< .cse12 (+ .cse11 1)) (< .cse11 c_~min3~0) (< (select .cse13 .cse3) .cse12) (< (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< c_~min1~0 (+ .cse12 1)))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse18 (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 ((.cse14 (select .cse18 .cse4)) (.cse16 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse15 (select .cse18 .cse3)) (.cse17 (select .cse18 .cse2))) (or (< .cse14 (+ .cse15 1)) (< .cse16 (+ .cse14 1)) (< .cse17 c_~min3~0) (< .cse15 .cse7) (< c_~min2~0 (+ .cse16 1)) (< .cse15 c_~min1~0) (< .cse17 c_~min1~0))))) .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 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse21 (select .cse22 .cse4))) (or (< c_~min1~0 (+ .cse20 1)) (< .cse21 c_~min2~0) (< .cse20 (+ .cse21 1)) (< (select .cse22 .cse3) .cse21) (< (select .cse22 .cse2) .cse21) (= c_~min2~0 .cse21))))) (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 ((.cse23 (select .cse26 .cse3)) (.cse24 (select .cse26 .cse2)) (.cse25 (select .cse26 .cse4))) (or (< .cse23 (+ .cse24 1)) (= c_~min3~0 .cse24) (< .cse25 (+ .cse23 1)) (< .cse24 c_~min3~0) (< (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< c_~min1~0 (+ .cse25 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse29 (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 .cse29 .cse2)) (.cse27 (select .cse29 .cse4))) (or (< .cse27 (+ .cse28 1)) (< .cse28 c_~min2~0) (< (select .cse29 .cse3) .cse27) (< (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= c_~min2~0 .cse28) (< c_~min1~0 (+ .cse27 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse32 (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 ((.cse30 (select .cse32 .cse2)) (.cse31 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min3~0 .cse30) (< c_~min1~0 (+ .cse31 1)) (< (select .cse32 .cse3) .cse31) (< .cse30 c_~min3~0) (< .cse31 (+ .cse30 1)) (< (select .cse32 .cse4) .cse31))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse36 (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 .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse33 (select .cse36 .cse2)) (.cse34 (select .cse36 .cse4))) (or (= c_~min3~0 .cse33) (< .cse34 (+ .cse33 1)) (< c_~min1~0 (+ .cse35 1)) (< .cse35 (+ .cse34 1)) (< .cse33 c_~min3~0) (< (select .cse36 .cse3) .cse34))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse39 (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 ((.cse38 (select .cse39 .cse2)) (.cse37 (select .cse39 .cse3))) (or (< .cse37 (+ .cse38 1)) (= c_~min3~0 .cse38) (< (select .cse39 .cse4) c_~min1~0) (< .cse38 c_~min3~0) (< c_~min1~0 (+ .cse37 1)) (< (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) (or .cse19 (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 ((.cse40 (select .cse43 .cse4)) (.cse41 (select .cse43 .cse3)) (.cse42 (select .cse43 .cse2))) (or (< .cse40 (+ .cse41 1)) (< .cse42 c_~min3~0) (< .cse41 .cse7) (< c_~min2~0 (+ .cse40 1)) (< .cse41 c_~min1~0) (< .cse42 c_~min1~0) (< (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse48 (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 ((.cse46 (select .cse48 .cse2))) (let ((.cse45 (select .cse48 .cse3)) (.cse44 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse47 (+ .cse46 1))) (or (< .cse44 (+ .cse45 1)) (= c_~min1~0 .cse46) (< .cse45 .cse47) (< c_~min2~0 (+ .cse44 1)) (< (select .cse48 .cse4) .cse44) (< c_~min3~0 .cse47) (< .cse46 c_~min1~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse52 (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 ((.cse50 (select .cse52 .cse3)) (.cse51 (select .cse52 .cse2)) (.cse49 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse49 (+ .cse50 1)) (< .cse50 (+ .cse51 1)) (< c_~min1~0 (+ .cse49 1)) (< .cse51 c_~min2~0) (= c_~min2~0 .cse51) (< (select .cse52 .cse4) .cse49))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse55 (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 ((.cse53 (select .cse55 .cse3)) (.cse54 (select .cse55 .cse2))) (or (< .cse53 (+ .cse54 1)) (< (select .cse55 .cse4) c_~min1~0) (< c_~min1~0 (+ .cse53 1)) (< .cse54 c_~min2~0) (< (select .cse55 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= c_~min2~0 .cse54))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse57 (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 ((.cse56 (select .cse57 .cse2))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse59 (+ .cse56 1))) (or (= c_~min1~0 .cse56) (< (select .cse57 .cse3) .cse58) (< .cse58 .cse59) (< c_~min2~0 (+ .cse58 1)) (< (select .cse57 .cse4) .cse58) (< c_~min3~0 .cse59) (< .cse56 c_~min1~0)))))) (or .cse60 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse65 (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 ((.cse61 (select .cse65 .cse4)) (.cse62 (select .cse65 .cse2)) (.cse63 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse64 (select .cse65 .cse3))) (or (< .cse61 c_~min2~0) (< .cse61 c_~min1~0) (< .cse62 c_~min2~0) (< .cse63 c_~min1~0) (< .cse64 c_~min1~0) (< c_~min3~0 (+ .cse62 1)) (< .cse62 c_~min1~0) (< .cse63 c_~min2~0) (< .cse64 c_~min2~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse66 (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 ((.cse67 (select .cse66 .cse2)) (.cse68 (select .cse66 .cse3))) (or (< (select .cse66 .cse4) c_~min2~0) (< .cse67 .cse68) (= .cse68 c_~min1~0) (< .cse68 c_~min1~0) (< c_~min3~0 (+ .cse67 1)) (< (select .cse66 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< c_~min2~0 (+ .cse68 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse72 (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 ((.cse69 (select .cse72 .cse2))) (let ((.cse71 (+ .cse69 1)) (.cse70 (select .cse72 .cse3))) (or (= c_~min1~0 .cse69) (< .cse70 .cse71) (< (select .cse72 .cse4) c_~min2~0) (< c_~min3~0 .cse71) (< .cse69 c_~min1~0) (< (select .cse72 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< c_~min2~0 (+ .cse70 1))))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse76 (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 ((.cse73 (select .cse76 .cse3)) (.cse74 (select .cse76 .cse2)) (.cse75 (select .cse76 .cse4))) (or (< .cse73 (+ .cse74 1)) (< .cse75 (+ .cse73 1)) (< .cse74 c_~min2~0) (< (select .cse76 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= c_~min2~0 .cse74) (< c_~min1~0 (+ .cse75 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse79 (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 ((.cse77 (select .cse79 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse78 (select .cse79 .cse3))) (or (< .cse77 (+ .cse78 1)) (< (select .cse79 .cse2) c_~min3~0) (< c_~min2~0 (+ .cse77 1)) (= .cse78 c_~min1~0) (< .cse78 c_~min1~0) (< (select .cse79 .cse4) .cse77) (< c_~min3~0 .cse78))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse82 (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 .cse82 .cse4)) (.cse81 (select .cse82 .cse2))) (or (< .cse80 c_~min1~0) (< .cse81 c_~min3~0) (< .cse80 .cse7) (< (select .cse82 .cse3) .cse80) (< c_~min2~0 (+ .cse80 1)) (< .cse81 c_~min1~0) (< (select .cse82 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse87 (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 ((.cse83 (select .cse87 .cse4)) (.cse85 (select .cse87 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse84 (select .cse87 .cse3)) (.cse86 (select .cse87 .cse2))) (or (< .cse83 (+ .cse84 1)) (< .cse85 (+ .cse83 1)) (< c_~min2~0 (+ .cse85 1)) (< .cse86 .cse84) (= .cse84 c_~min1~0) (< .cse84 c_~min1~0) (< c_~min3~0 (+ .cse86 1)))))) (or (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 ((.cse88 (select .cse92 .cse4)) (.cse89 (select .cse92 .cse2)) (.cse90 (select .cse92 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse91 (select .cse92 .cse3))) (or (< .cse88 c_~min2~0) (< .cse88 c_~min1~0) (< .cse89 c_~min3~0) (< .cse90 c_~min1~0) (< .cse91 c_~min1~0) (< .cse89 c_~min1~0) (< .cse90 c_~min2~0) (< .cse91 c_~min2~0))))) (and (or .cse19 (< c_~min2~0 .cse7)) (or .cse60 (< c_~min3~0 c_~min2~0)))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse94 (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 .cse94 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse93) (< c_~min1~0 (+ .cse93 1)) (< (select .cse94 .cse3) .cse93) (< (select .cse94 .cse4) .cse93) (< (select .cse94 .cse2) .cse93) (< .cse93 c_~min2~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse99 (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 ((.cse95 (select .cse99 .cse2))) (let ((.cse98 (select .cse99 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse96 (select .cse99 .cse4)) (.cse97 (+ .cse95 1))) (or (= c_~min1~0 .cse95) (< .cse96 .cse97) (< .cse98 (+ .cse96 1)) (< c_~min2~0 (+ .cse98 1)) (< (select .cse99 .cse3) .cse96) (< c_~min3~0 .cse97) (< .cse95 c_~min1~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse102 (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 ((.cse101 (select .cse102 .cse3)) (.cse100 (select .cse102 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse100 (+ .cse101 1)) (< c_~min1~0 (+ .cse100 1)) (< .cse101 .cse7) (< (select .cse102 .cse2) .cse101) (< (select .cse102 .cse4) .cse100))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse103 (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 ((.cse104 (select .cse103 .cse3))) (or (< (select .cse103 .cse4) c_~min2~0) (< (select .cse103 .cse2) c_~min3~0) (= .cse104 c_~min1~0) (< .cse104 c_~min1~0) (< (select .cse103 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< c_~min3~0 .cse104) (< c_~min2~0 (+ .cse104 1)))))) (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 .cse4))) (or (< .cse105 c_~min2~0) (< (select .cse106 .cse3) .cse105) (< (select .cse106 .cse2) .cse105) (< (select .cse106 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= c_~min2~0 .cse105) (< c_~min1~0 (+ .cse105 1)))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse108 (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 ((.cse107 (select .cse108 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse109 (select .cse108 .cse2))) (or (< .cse107 .cse7) (< (select .cse108 .cse3) .cse107) (< .cse109 c_~min3~0) (< c_~min2~0 (+ .cse107 1)) (< .cse107 c_~min1~0) (< (select .cse108 .cse4) .cse107) (< .cse109 c_~min1~0)))))) (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 ((.cse110 (select .cse111 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min1~0 .cse110) (< (select .cse111 .cse3) .cse110) (< (select .cse111 .cse2) c_~min3~0) (< c_~min2~0 (+ .cse110 1)) (< .cse110 c_~min1~0) (< (select .cse111 .cse4) .cse110) (< c_~min3~0 .cse110))))) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse115 (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 ((.cse113 (select .cse115 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse112 (select .cse115 .cse4)) (.cse114 (select .cse115 .cse2))) (or (< .cse112 c_~min1~0) (< .cse113 (+ .cse112 1)) (< .cse114 c_~min3~0) (< .cse112 .cse7) (< c_~min2~0 (+ .cse113 1)) (< (select .cse115 .cse3) .cse112) (< .cse114 c_~min1~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse116 (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 ((.cse117 (select .cse116 .cse2))) (or (< (select .cse116 .cse4) c_~min1~0) (< .cse117 c_~min2~0) (< c_~min1~0 (+ .cse117 1)) (< (select .cse116 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= c_~min2~0 .cse117) (< (select .cse116 .cse3) c_~min1~0))))) (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 ((.cse119 (select .cse118 .cse3))) (or (< (select .cse118 .cse4) c_~min1~0) (< c_~min1~0 (+ .cse119 1)) (< (select .cse118 .cse2) .cse119) (< (select .cse118 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= .cse119 c_~min2~0) (< .cse119 c_~min2~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse121 (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 ((.cse120 (select .cse121 .cse4)) (.cse122 (select .cse121 .cse2))) (or (= c_~min1~0 .cse120) (< .cse120 c_~min1~0) (< (select .cse121 .cse3) .cse120) (< c_~min2~0 (+ .cse120 1)) (< .cse122 .cse120) (< c_~min3~0 (+ .cse122 1)) (< (select .cse121 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse124 (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 ((.cse125 (select .cse124 .cse2)) (.cse123 (select .cse124 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min1~0 .cse123) (< (select .cse124 .cse3) .cse123) (< c_~min2~0 (+ .cse123 1)) (< .cse123 c_~min1~0) (< (select .cse124 .cse4) .cse123) (< c_~min3~0 (+ .cse125 1)) (< .cse125 .cse123))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse127 (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 ((.cse126 (select .cse127 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~min1~0 (+ .cse126 1)) (< .cse126 .cse7) (< (select .cse127 .cse3) .cse126) (< (select .cse127 .cse4) .cse126) (< (select .cse127 .cse2) .cse126))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse129 (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 ((.cse128 (select .cse129 .cse2))) (or (= c_~min3~0 .cse128) (< (select .cse129 .cse4) c_~min1~0) (< .cse128 c_~min3~0) (< c_~min1~0 (+ .cse128 1)) (< (select .cse129 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (select .cse129 .cse3) c_~min1~0))))) (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 ((.cse130 (select .cse132 .cse4)) (.cse131 (select .cse132 .cse3))) (or (< .cse130 (+ .cse131 1)) (< (select .cse132 .cse2) .cse131) (< (select .cse132 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< c_~min1~0 (+ .cse130 1)) (= .cse131 c_~min2~0) (< .cse131 c_~min2~0))))) (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 .cse4)) (.cse135 (select .cse136 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse134 (select .cse136 .cse3))) (or (< .cse133 (+ .cse134 1)) (< .cse135 (+ .cse133 1)) (< (select .cse136 .cse2) c_~min3~0) (< c_~min2~0 (+ .cse135 1)) (= .cse134 c_~min1~0) (< .cse134 c_~min1~0) (< c_~min3~0 .cse134))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse137 (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 ((.cse138 (select .cse137 .cse2)) (.cse139 (select .cse137 .cse3))) (or (< (select .cse137 .cse4) c_~min2~0) (< .cse138 c_~min3~0) (< .cse139 .cse7) (< .cse139 c_~min1~0) (< .cse138 c_~min1~0) (< (select .cse137 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< c_~min2~0 (+ .cse139 1)))))) .cse19) (or .cse19 (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse143 (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 .cse143 .cse3)) (.cse140 (select .cse143 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse142 (select .cse143 .cse2))) (or (< .cse140 (+ .cse141 1)) (< .cse142 c_~min3~0) (< .cse141 .cse7) (< c_~min2~0 (+ .cse140 1)) (< .cse141 c_~min1~0) (< (select .cse143 .cse4) .cse140) (< .cse142 c_~min1~0)))))) (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 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse144 (select .cse146 .cse4)) (.cse147 (select .cse146 .cse2))) (or (= c_~min1~0 .cse144) (< .cse144 c_~min1~0) (< .cse145 (+ .cse144 1)) (< c_~min2~0 (+ .cse145 1)) (< (select .cse146 .cse3) .cse144) (< .cse147 .cse144) (< c_~min3~0 (+ .cse147 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse152 (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 ((.cse148 (select .cse152 .cse2))) (let ((.cse149 (select .cse152 .cse3)) (.cse151 (select .cse152 .cse4)) (.cse150 (+ .cse148 1))) (or (= c_~min1~0 .cse148) (< .cse149 .cse150) (< .cse151 (+ .cse149 1)) (< c_~min2~0 (+ .cse151 1)) (< c_~min3~0 .cse150) (< .cse148 c_~min1~0) (< (select .cse152 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0)))))) (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 ((.cse153 (select .cse156 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse154 (select .cse156 .cse4)) (.cse155 (select .cse156 .cse3))) (or (< c_~min1~0 (+ .cse153 1)) (< .cse154 (+ .cse155 1)) (< .cse153 (+ .cse154 1)) (< .cse155 .cse7) (< (select .cse156 .cse2) .cse155))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse159 (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 ((.cse157 (select .cse159 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse158 (select .cse159 .cse3))) (or (< .cse157 (+ .cse158 1)) (< c_~min1~0 (+ .cse157 1)) (< (select .cse159 .cse2) .cse158) (< (select .cse159 .cse4) .cse157) (= .cse158 c_~min2~0) (< .cse158 c_~min2~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse162 (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 ((.cse161 (select .cse162 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse160 (select .cse162 .cse4))) (or (= c_~min1~0 .cse160) (< .cse160 c_~min1~0) (< .cse161 (+ .cse160 1)) (< (select .cse162 .cse2) c_~min3~0) (< c_~min3~0 .cse160) (< c_~min2~0 (+ .cse161 1)) (< (select .cse162 .cse3) .cse160))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse166 (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 .cse166 .cse3)) (.cse165 (select .cse166 .cse2)) (.cse163 (select .cse166 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse163 (+ .cse164 1)) (< .cse164 (+ .cse165 1)) (= c_~min3~0 .cse165) (< c_~min1~0 (+ .cse163 1)) (< .cse165 c_~min3~0) (< (select .cse166 .cse4) .cse163))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse169 (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 ((.cse168 (select .cse169 .cse3)) (.cse167 (select .cse169 .cse4))) (or (< .cse167 (+ .cse168 1)) (< .cse168 .cse7) (< (select .cse169 .cse2) .cse168) (< (select .cse169 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< c_~min1~0 (+ .cse167 1)))))) (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 ((.cse170 (select .cse174 .cse3)) (.cse172 (select .cse174 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse173 (select .cse174 .cse4)) (.cse171 (select .cse174 .cse2))) (or (< .cse170 (+ .cse171 1)) (< c_~min1~0 (+ .cse172 1)) (< .cse173 (+ .cse170 1)) (< .cse172 (+ .cse173 1)) (< .cse171 c_~min2~0) (= c_~min2~0 .cse171))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse178 (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 ((.cse175 (select .cse178 .cse4)) (.cse176 (select .cse178 .cse3)) (.cse177 (select .cse178 .cse2))) (or (< .cse175 (+ .cse176 1)) (< c_~min2~0 (+ .cse175 1)) (< .cse177 .cse176) (= .cse176 c_~min1~0) (< .cse176 c_~min1~0) (< c_~min3~0 (+ .cse177 1)) (< (select .cse178 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0))))) (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|)) (.cse179 (select .cse182 .cse4)) (.cse180 (select .cse182 .cse2))) (or (< .cse179 (+ .cse180 1)) (< c_~min1~0 (+ .cse181 1)) (< .cse181 (+ .cse179 1)) (< .cse180 c_~min2~0) (< (select .cse182 .cse3) .cse179) (= c_~min2~0 .cse180))))) (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 ((.cse183 (select .cse185 .cse4)) (.cse184 (select .cse185 .cse3))) (or (< .cse183 (+ .cse184 1)) (< (select .cse185 .cse2) c_~min3~0) (< c_~min2~0 (+ .cse183 1)) (= .cse184 c_~min1~0) (< .cse184 c_~min1~0) (< (select .cse185 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< c_~min3~0 .cse184))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse191 (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 ((.cse186 (select .cse191 .cse2))) (let ((.cse187 (select .cse191 .cse3)) (.cse189 (select .cse191 .cse4)) (.cse190 (select .cse191 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse188 (+ .cse186 1))) (or (= c_~min1~0 .cse186) (< .cse187 .cse188) (< .cse189 (+ .cse187 1)) (< .cse190 (+ .cse189 1)) (< c_~min2~0 (+ .cse190 1)) (< c_~min3~0 .cse188) (< .cse186 c_~min1~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse195 (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 ((.cse192 (select .cse195 .cse2))) (let ((.cse193 (select .cse195 .cse4)) (.cse194 (+ .cse192 1))) (or (= c_~min1~0 .cse192) (< .cse193 .cse194) (< (select .cse195 .cse3) .cse193) (< c_~min2~0 (+ .cse193 1)) (< c_~min3~0 .cse194) (< .cse192 c_~min1~0) (< (select .cse195 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse197 (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 ((.cse198 (select .cse197 .cse2)) (.cse196 (select .cse197 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~min1~0 (+ .cse196 1)) (< (select .cse197 .cse3) .cse196) (< .cse196 (+ .cse198 1)) (< .cse198 c_~min2~0) (= c_~min2~0 .cse198) (< (select .cse197 .cse4) .cse196))))) (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 ((.cse199 (select .cse203 .cse3)) (.cse201 (select .cse203 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse202 (select .cse203 .cse4)) (.cse200 (select .cse203 .cse2))) (or (< .cse199 (+ .cse200 1)) (= c_~min3~0 .cse200) (< c_~min1~0 (+ .cse201 1)) (< .cse202 (+ .cse199 1)) (< .cse201 (+ .cse202 1)) (< .cse200 c_~min3~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse207 (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 ((.cse205 (select .cse207 .cse3)) (.cse204 (select .cse207 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse206 (select .cse207 .cse2))) (or (< .cse204 (+ .cse205 1)) (< c_~min2~0 (+ .cse204 1)) (< .cse206 .cse205) (= .cse205 c_~min1~0) (< .cse205 c_~min1~0) (< (select .cse207 .cse4) .cse204) (< c_~min3~0 (+ .cse206 1)))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse211 (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 .cse211 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse209 (select .cse211 .cse4)) (.cse210 (select .cse211 .cse3))) (or (< c_~min1~0 (+ .cse208 1)) (< .cse209 (+ .cse210 1)) (< .cse208 (+ .cse209 1)) (< (select .cse211 .cse2) .cse210) (= .cse210 c_~min2~0) (< .cse210 c_~min2~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse212 (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 ((.cse213 (select .cse212 .cse3))) (or (< (select .cse212 .cse4) c_~min1~0) (< .cse213 .cse7) (< c_~min1~0 (+ .cse213 1)) (< (select .cse212 .cse2) .cse213) (< (select .cse212 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 (Array Int Int)) (v_ArrVal_310 (Array Int Int))) (let ((.cse215 (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 ((.cse214 (select .cse215 .cse2))) (let ((.cse216 (+ .cse214 1))) (or (= c_~min1~0 .cse214) (< (select .cse215 .cse4) c_~min2~0) (< c_~min2~0 .cse216) (< c_~min3~0 .cse216) (< .cse214 c_~min1~0) (< (select .cse215 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< (select .cse215 .cse3) c_~min2~0))))))))) is different from false [2024-01-26 01:47:12,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:12,330 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 182 [2024-01-26 01:47:12,487 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:47:12,488 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 2200 treesize of output 2088 [2024-01-26 01:47:12,646 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:12,647 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:47:13,463 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:13,464 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:47:13,552 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:13,552 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:47:15,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:15,841 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 203 [2024-01-26 01:47:16,010 INFO L349 Elim1Store]: treesize reduction 22, result has 33.3 percent of original size [2024-01-26 01:47:16,011 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 2364 treesize of output 2232 [2024-01-26 01:47:16,155 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-01-26 01:47:16,155 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 1029 treesize of output 829 [2024-01-26 01:47:16,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:16,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:16,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:16,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-26 01:47:16,242 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 359 treesize of output 312 [2024-01-26 01:47:16,339 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-01-26 01:47:16,339 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 419 treesize of output 321 [2024-01-26 01:47:18,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:18,596 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 151 [2024-01-26 01:47:18,754 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:47:18,755 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 1899 treesize of output 1803 [2024-01-26 01:47:18,891 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:18,892 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 910 treesize of output 754 [2024-01-26 01:47:18,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:18,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:18,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:18,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:18,954 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 356 treesize of output 323 [2024-01-26 01:47:19,063 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:19,064 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 391 treesize of output 317 [2024-01-26 01:47:20,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:20,463 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 132 [2024-01-26 01:47:20,631 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:47:20,631 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 1618 treesize of output 1540 [2024-01-26 01:47:20,751 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:20,752 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 362 treesize of output 302 [2024-01-26 01:47:20,868 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:20,868 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 294 treesize of output 268 [2024-01-26 01:47:21,835 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:21,835 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 391 treesize of output 263 [2024-01-26 01:47:22,085 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:22,085 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:47:22,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:22,109 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:47:22,329 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:22,329 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 3847 treesize of output 3647 [2024-01-26 01:47:22,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:22,497 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 421 treesize of output 377 [2024-01-26 01:47:22,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:22,624 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 345 treesize of output 339 [2024-01-26 01:47:23,721 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:23,722 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 325 [2024-01-26 01:47:24,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:24,026 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:47:24,219 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:47:24,220 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 8740 treesize of output 8314 [2024-01-26 01:47:24,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:24,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:24,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:24,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:24,364 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 485 treesize of output 452 [2024-01-26 01:47:24,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:24,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:24,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:24,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:24,439 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 761 treesize of output 605 [2024-01-26 01:47:24,674 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:24,678 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 366 [2024-01-26 01:47:26,158 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:26,159 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:26,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:26,185 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:47:26,420 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:26,420 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 7487 treesize of output 7095 [2024-01-26 01:47:26,690 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:26,690 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 423 treesize of output 411 [2024-01-26 01:47:26,903 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:26,904 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 839 treesize of output 719 [2024-01-26 01:47:27,121 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:27,122 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 381 treesize of output 333 [2024-01-26 01:47:28,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:28,906 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 175 [2024-01-26 01:47:29,176 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-01-26 01:47:29,177 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 4252 treesize of output 4055 [2024-01-26 01:47:29,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:29,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:29,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 476 treesize of output 462 [2024-01-26 01:47:29,597 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:29,598 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 944 treesize of output 816 [2024-01-26 01:47:29,811 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:29,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 431 treesize of output 379 [2024-01-26 01:47:32,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:32,433 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:47:32,617 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:47:32,618 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 4126 [2024-01-26 01:47:32,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:32,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:32,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:32,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:32,755 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 493 treesize of output 460 [2024-01-26 01:47:32,864 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:32,864 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 978 treesize of output 822 [2024-01-26 01:47:32,980 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:32,981 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:47:34,819 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:34,819 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:34,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:34,858 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:47:35,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:35,024 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 1248 treesize of output 1215 [2024-01-26 01:47:35,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:35,211 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 1295 treesize of output 1139 [2024-01-26 01:47:35,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:35,379 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 1107 treesize of output 1045 [2024-01-26 01:47:35,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:35,551 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 526 treesize of output 511 [2024-01-26 01:47:40,920 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:40,920 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:47:40,949 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:40,950 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:40,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:40,983 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:47:41,238 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:41,238 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 2130 [2024-01-26 01:47:41,499 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:41,499 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 859 [2024-01-26 01:47:41,763 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:41,763 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 378 [2024-01-26 01:47:41,997 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:41,997 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 371 [2024-01-26 01:47:48,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:48,191 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:48,428 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:48,429 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 4276 treesize of output 4080 [2024-01-26 01:47:48,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:48,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 487 treesize of output 441 [2024-01-26 01:47:48,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:48,756 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 409 treesize of output 402 [2024-01-26 01:47:51,022 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:51,023 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 519 treesize of output 387 [2024-01-26 01:47:51,581 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:51,581 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:47:51,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:51,610 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:51,760 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:51,761 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 7999 treesize of output 7542 [2024-01-26 01:47:51,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:51,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:51,907 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-01-26 01:47:51,908 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 421 treesize of output 383 [2024-01-26 01:47:52,003 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-01-26 01:47:52,003 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 832 treesize of output 668 [2024-01-26 01:47:52,105 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-01-26 01:47:52,106 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 359 treesize of output 279 [2024-01-26 01:47:52,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:52,799 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:52,958 INFO L349 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2024-01-26 01:47:52,959 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 2057 [2024-01-26 01:47:53,127 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:53,127 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 927 [2024-01-26 01:47:53,254 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:53,254 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 893 treesize of output 729 [2024-01-26 01:47:53,372 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:53,372 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:54,166 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:54,167 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:54,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:54,196 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:47:54,334 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:54,335 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 802 treesize of output 760 [2024-01-26 01:47:54,460 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:54,461 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 724 treesize of output 596 [2024-01-26 01:47:54,569 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:54,570 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 540 treesize of output 480 [2024-01-26 01:47:54,675 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-01-26 01:47:54,675 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 244 treesize of output 218 [2024-01-26 01:47:55,569 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:55,569 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:55,592 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:55,592 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:47:55,614 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:55,615 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:47:55,637 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:55,637 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:55,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:55,667 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:47:55,845 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-01-26 01:47:55,846 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:47:55,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:55,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:55,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:55,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:55,991 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 521 treesize of output 488 [2024-01-26 01:47:56,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:56,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:56,026 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-26 01:47:56,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:56,066 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 896 treesize of output 822 [2024-01-26 01:47:56,173 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-01-26 01:47:56,173 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 841 treesize of output 685 [2024-01-26 01:47:58,254 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:58,255 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:58,283 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:47:58,283 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:58,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:47:58,320 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:58,637 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:58,638 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 8308 treesize of output 7916 [2024-01-26 01:47:58,960 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:58,960 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 478 treesize of output 466 [2024-01-26 01:47:59,179 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:59,180 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 948 treesize of output 828 [2024-01-26 01:47:59,428 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:47:59,428 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 435 treesize of output 387 [2024-01-26 01:48:01,558 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:01,558 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:48:01,579 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:01,579 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:48:01,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:01,607 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 141 [2024-01-26 01:48:01,847 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:48:01,847 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 3234 treesize of output 3074 [2024-01-26 01:48:02,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:02,011 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 356 treesize of output 324 [2024-01-26 01:48:02,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:02,139 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 292 treesize of output 292 [2024-01-26 01:48:03,494 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-01-26 01:48:03,494 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 383 treesize of output 279 [2024-01-26 01:48:03,740 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,740 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:48:03,765 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,765 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 1 [2024-01-26 01:48:03,795 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,795 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:48:03,819 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,819 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 1 [2024-01-26 01:48:03,842 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,842 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:48:03,864 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,865 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:48:03,888 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,888 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:48:03,911 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,911 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:48:03,934 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,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 284 treesize of output 1 [2024-01-26 01:48:03,963 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,964 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:48:03,988 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:03,988 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:48:04,013 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:04,013 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:48:04,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:04,086 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:48:04,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:04,253 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 4585 treesize of output 4393 [2024-01-26 01:48:04,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:04,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 561 treesize of output 513 [2024-01-26 01:48:04,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:04,682 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 473 [2024-01-26 01:48:08,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:48:08,359 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 593 treesize of output 465 [2024-01-26 01:48:08,693 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,694 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:48:08,716 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,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 305 treesize of output 1 [2024-01-26 01:48:08,738 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,738 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:48:08,760 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,760 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:48:08,783 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,783 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:48:08,809 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,810 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:48:08,833 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,834 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:48:08,858 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,858 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 1 [2024-01-26 01:48:08,881 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,881 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:48:08,905 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 280 treesize of output 1 [2024-01-26 01:48:08,928 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,929 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:48:08,952 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,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 254 treesize of output 1 [2024-01-26 01:48:08,976 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:08,977 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:48:08,999 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:09,000 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:48:09,023 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-01-26 01:48:09,023 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:48:16,406 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:48:16,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235469791] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:48:16,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:48:16,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 53, 48] total 117 [2024-01-26 01:48:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645288341] [2024-01-26 01:48:16,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:48:16,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2024-01-26 01:48:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:48:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2024-01-26 01:48:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=12361, Unknown=84, NotChecked=228, Total=13572 [2024-01-26 01:48:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:48:16,414 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:48:16,415 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:48:16,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:48:16,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-01-26 01:48:16,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 01:48:16,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-01-26 01:48:16,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:48:16,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-01-26 01:48:16,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-01-26 01:48:16,416 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:49:03,882 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 609 DAG size of output: 297 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:49:22,562 WARN L293 SmtUtils]: Spent 9.29s on a formula simplification. DAG size of input: 611 DAG size of output: 299 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:49:39,461 WARN L293 SmtUtils]: Spent 9.41s on a formula simplification. DAG size of input: 613 DAG size of output: 299 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:49:56,942 WARN L293 SmtUtils]: Spent 9.52s on a formula simplification. DAG size of input: 611 DAG size of output: 297 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-26 01:49:59,741 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:51:16,196 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:51:16,197 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:51:16,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-01-26 01:51:16,404 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:51:16,404 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.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:680) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) 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: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) ... 45 more [2024-01-26 01:51:16,408 INFO L158 Benchmark]: Toolchain (without parser) took 538014.19ms. Allocated memory was 257.9MB in the beginning and 1.0GB in the end (delta: 773.8MB). Free memory was 203.5MB in the beginning and 641.3MB in the end (delta: -437.8MB). Peak memory consumption was 337.6MB. Max. memory is 8.0GB. [2024-01-26 01:51:16,408 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 01:51:16,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.73ms. Allocated memory is still 257.9MB. Free memory was 202.9MB in the beginning and 190.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-01-26 01:51:16,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.46ms. Allocated memory is still 257.9MB. Free memory was 190.9MB in the beginning and 189.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:51:16,409 INFO L158 Benchmark]: Boogie Preprocessor took 32.86ms. Allocated memory is still 257.9MB. Free memory was 189.3MB in the beginning and 187.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:51:16,409 INFO L158 Benchmark]: RCFGBuilder took 514.16ms. Allocated memory is still 257.9MB. Free memory was 187.2MB in the beginning and 164.7MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-01-26 01:51:16,409 INFO L158 Benchmark]: TraceAbstraction took 537147.92ms. Allocated memory was 257.9MB in the beginning and 1.0GB in the end (delta: 773.8MB). Free memory was 164.1MB in the beginning and 641.3MB in the end (delta: -477.1MB). Peak memory consumption was 297.8MB. Max. memory is 8.0GB. [2024-01-26 01:51:16,410 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.12ms. Allocated memory is still 186.6MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.73ms. Allocated memory is still 257.9MB. Free memory was 202.9MB in the beginning and 190.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.46ms. Allocated memory is still 257.9MB. Free memory was 190.9MB in the beginning and 189.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.86ms. Allocated memory is still 257.9MB. Free memory was 189.3MB in the beginning and 187.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 514.16ms. Allocated memory is still 257.9MB. Free memory was 187.2MB in the beginning and 164.7MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 537147.92ms. Allocated memory was 257.9MB in the beginning and 1.0GB in the end (delta: 773.8MB). Free memory was 164.1MB in the beginning and 641.3MB in the end (delta: -477.1MB). Peak memory consumption was 297.8MB. 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:51:16,425 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...