/root/.sdkman/candidates/java/current/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/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -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-a4a1cd3-m [2024-05-30 23:13:13,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 23:13:13,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 23:13:13,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 23:13:13,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 23:13:13,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 23:13:13,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 23:13:13,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 23:13:13,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 23:13:13,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 23:13:13,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 23:13:13,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 23:13:13,215 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 23:13:13,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 23:13:13,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 23:13:13,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 23:13:13,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 23:13:13,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 23:13:13,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 23:13:13,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 23:13:13,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 23:13:13,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 23:13:13,218 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 23:13:13,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 23:13:13,218 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 23:13:13,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 23:13:13,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 23:13:13,219 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 23:13:13,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 23:13:13,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 23:13:13,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 23:13:13,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 23:13:13,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 23:13:13,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 23:13:13,221 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 23:13:13,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 23:13:13,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 23:13:13,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 23:13:13,221 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 23:13:13,221 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2024-05-30 23:13:13,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 23:13:13,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 23:13:13,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 23:13:13,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 23:13:13,478 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 23:13:13,479 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-05-30 23:13:14,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 23:13:14,690 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 23:13:14,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2024-05-30 23:13:14,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/42a46dd5e/683c5c2c462e48039857666229a1a93b/FLAG8ef192578 [2024-05-30 23:13:14,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/42a46dd5e/683c5c2c462e48039857666229a1a93b [2024-05-30 23:13:14,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 23:13:14,708 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 23:13:14,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 23:13:14,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 23:13:14,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 23:13:14,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72611506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14, skipping insertion in model container [2024-05-30 23:13:14,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 23:13:14,864 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[2586,2599] [2024-05-30 23:13:14,869 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 23:13:14,875 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 23:13:14,889 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[2586,2599] [2024-05-30 23:13:14,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 23:13:14,901 INFO L206 MainTranslator]: Completed translation [2024-05-30 23:13:14,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14 WrapperNode [2024-05-30 23:13:14,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 23:13:14,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 23:13:14,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 23:13:14,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 23:13:14,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,927 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2024-05-30 23:13:14,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 23:13:14,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 23:13:14,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 23:13:14,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 23:13:14,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 23:13:14,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 23:13:14,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 23:13:14,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 23:13:14,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (1/1) ... [2024-05-30 23:13:14,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 23:13:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:15,008 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-05-30 23:13:15,015 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-05-30 23:13:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 23:13:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 23:13:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 23:13:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 23:13:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 23:13:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 23:13:15,046 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 23:13:15,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 23:13:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 23:13:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 23:13:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 23:13:15,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 23:13:15,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 23:13:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 23:13:15,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 23:13:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 23:13:15,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 23:13:15,050 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 23:13:15,119 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 23:13:15,120 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 23:13:15,364 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 23:13:15,405 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 23:13:15,406 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-30 23:13:15,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 11:13:15 BoogieIcfgContainer [2024-05-30 23:13:15,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 23:13:15,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 23:13:15,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 23:13:15,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 23:13:15,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 11:13:14" (1/3) ... [2024-05-30 23:13:15,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d806ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 11:13:15, skipping insertion in model container [2024-05-30 23:13:15,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 11:13:14" (2/3) ... [2024-05-30 23:13:15,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d806ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 11:13:15, skipping insertion in model container [2024-05-30 23:13:15,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 11:13:15" (3/3) ... [2024-05-30 23:13:15,412 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2024-05-30 23:13:15,418 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 23:13:15,424 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 23:13:15,424 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 23:13:15,424 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 23:13:15,467 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-30 23:13:15,497 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 23:13:15,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 23:13:15,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:15,500 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-05-30 23:13:15,520 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-05-30 23:13:15,562 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 23:13:15,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 23:13:15,571 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@175403cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 23:13:15,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 23:13:15,834 INFO L78 Accepts]: Start accepts. Automaton has currently 615 states, but on-demand construction may add more states Word has length 112 [2024-05-30 23:13:15,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:15,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:15,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1808586548, now seen corresponding path program 1 times [2024-05-30 23:13:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:15,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117584798] [2024-05-30 23:13:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:16,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:16,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117584798] [2024-05-30 23:13:16,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117584798] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 23:13:16,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 23:13:16,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 23:13:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265644292] [2024-05-30 23:13:16,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:13:16,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 23:13:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 23:13:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 23:13:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:16,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:16,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 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-05-30 23:13:16,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:16,137 INFO L78 Accepts]: Start accepts. Automaton has currently 615 states, but on-demand construction may add more states Word has length 108 [2024-05-30 23:13:16,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:16,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 23:13:16,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:16,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash -575844458, now seen corresponding path program 1 times [2024-05-30 23:13:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111063946] [2024-05-30 23:13:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111063946] [2024-05-30 23:13:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111063946] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 23:13:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 23:13:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 23:13:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993533136] [2024-05-30 23:13:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:13:16,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 23:13:16,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:16,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 23:13:16,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-30 23:13:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:16,515 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:16,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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-05-30 23:13:16,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:16,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:16,655 INFO L78 Accepts]: Start accepts. Automaton has currently 660 states, but on-demand construction may add more states Word has length 113 [2024-05-30 23:13:16,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:16,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 23:13:16,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:16,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1879983486, now seen corresponding path program 1 times [2024-05-30 23:13:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974075046] [2024-05-30 23:13:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:17,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974075046] [2024-05-30 23:13:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974075046] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 23:13:17,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 23:13:17,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-30 23:13:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383543714] [2024-05-30 23:13:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:13:17,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-30 23:13:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:17,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-30 23:13:17,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-05-30 23:13:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,080 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:17,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-05-30 23:13:17,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,254 INFO L78 Accepts]: Start accepts. Automaton has currently 668 states, but on-demand construction may add more states Word has length 121 [2024-05-30 23:13:17,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:17,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 23:13:17,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:17,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash -384917752, now seen corresponding path program 1 times [2024-05-30 23:13:17,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:17,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863089782] [2024-05-30 23:13:17,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 23:13:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863089782] [2024-05-30 23:13:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863089782] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:13:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202079743] [2024-05-30 23:13:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:17,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:17,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:17,478 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-05-30 23:13:17,504 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-05-30 23:13:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:17,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 23:13:17,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:13:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 23:13:17,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:13:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 23:13:17,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202079743] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 23:13:17,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-30 23:13:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-05-30 23:13:17,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106823745] [2024-05-30 23:13:17,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 23:13:17,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 23:13:17,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:17,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 23:13:17,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-30 23:13:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,862 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:17,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 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-05-30 23:13:17,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:17,939 INFO L78 Accepts]: Start accepts. Automaton has currently 243 states, but on-demand construction may add more states Word has length 126 [2024-05-30 23:13:17,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:17,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 23:13:18,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:18,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:18,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1633607660, now seen corresponding path program 1 times [2024-05-30 23:13:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472715363] [2024-05-30 23:13:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472715363] [2024-05-30 23:13:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472715363] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:13:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371236681] [2024-05-30 23:13:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:19,439 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-05-30 23:13:19,460 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-05-30 23:13:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:19,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-30 23:13:19,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:13:20,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:13:20,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2024-05-30 23:13:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:20,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:13:22,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:13:22,018 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 168 treesize of output 144 [2024-05-30 23:13:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371236681] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:13:25,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:13:25,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 19] total 55 [2024-05-30 23:13:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155862205] [2024-05-30 23:13:25,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:13:25,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-05-30 23:13:25,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:25,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-05-30 23:13:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2478, Unknown=0, NotChecked=0, Total=2970 [2024-05-30 23:13:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:25,663 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:25,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.054545454545455) internal successors, (333), 55 states have internal predecessors, (333), 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-05-30 23:13:25,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:25,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:25,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:25,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:25,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:13:26,502 INFO L78 Accepts]: Start accepts. Automaton has currently 378 states, but on-demand construction may add more states Word has length 139 [2024-05-30 23:13:26,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:26,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-30 23:13:26,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:26,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:26,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1457760110, now seen corresponding path program 2 times [2024-05-30 23:13:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724042381] [2024-05-30 23:13:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 23:13:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724042381] [2024-05-30 23:13:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724042381] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:13:26,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812932534] [2024-05-30 23:13:26,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 23:13:26,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:26,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:26,934 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-05-30 23:13:26,964 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-05-30 23:13:27,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 23:13:27,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:13:27,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 23:13:27,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:13:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 23:13:27,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:13:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 23:13:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812932534] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:13:27,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:13:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 22 [2024-05-30 23:13:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613099875] [2024-05-30 23:13:27,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:13:27,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-30 23:13:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-30 23:13:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-05-30 23:13:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:27,265 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:27,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.954545454545455) internal successors, (219), 22 states have internal predecessors, (219), 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-05-30 23:13:27,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:27,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:27,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:27,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:27,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:13:27,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:27,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:13:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:13:27,885 INFO L78 Accepts]: Start accepts. Automaton has currently 498 states, but on-demand construction may add more states Word has length 144 [2024-05-30 23:13:27,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:27,893 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-05-30 23:13:28,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:28,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:28,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash -331604999, now seen corresponding path program 1 times [2024-05-30 23:13:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:28,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026893722] [2024-05-30 23:13:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026893722] [2024-05-30 23:13:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026893722] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:13:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453528012] [2024-05-30 23:13:30,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:30,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:30,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:30,949 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-05-30 23:13:30,991 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-05-30 23:13:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:31,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 53 conjunts are in the unsatisfiable core [2024-05-30 23:13:31,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:13:33,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:13:33,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 78 [2024-05-30 23:13:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:33,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:13:36,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:13:36,984 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 535 treesize of output 271 [2024-05-30 23:13:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:39,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453528012] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:13:39,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:13:39,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 27] total 77 [2024-05-30 23:13:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622308635] [2024-05-30 23:13:39,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:13:39,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-05-30 23:13:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-05-30 23:13:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=5411, Unknown=0, NotChecked=0, Total=5852 [2024-05-30 23:13:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:39,657 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:39,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 4.766233766233766) internal successors, (367), 77 states have internal predecessors, (367), 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-05-30 23:13:39,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:39,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:39,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:39,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:39,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:13:39,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:13:39,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:13:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:13:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 23:13:42,285 INFO L78 Accepts]: Start accepts. Automaton has currently 526 states, but on-demand construction may add more states Word has length 157 [2024-05-30 23:13:42,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:42,299 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-05-30 23:13:42,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-05-30 23:13:42,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:42,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1263324787, now seen corresponding path program 2 times [2024-05-30 23:13:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:42,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633174972] [2024-05-30 23:13:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-30 23:13:42,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:42,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633174972] [2024-05-30 23:13:42,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633174972] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:13:42,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193756768] [2024-05-30 23:13:42,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 23:13:42,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:42,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:42,728 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-05-30 23:13:42,731 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-05-30 23:13:42,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 23:13:42,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:13:42,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-30 23:13:42,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:13:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-30 23:13:43,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:13:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-30 23:13:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193756768] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:13:43,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:13:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2024-05-30 23:13:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455332220] [2024-05-30 23:13:43,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:13:43,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-05-30 23:13:43,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:13:43,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-05-30 23:13:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2024-05-30 23:13:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:43,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:13:43,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.973684210526316) internal successors, (227), 38 states have internal predecessors, (227), 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-05-30 23:13:43,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:43,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:43,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:43,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:43,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:13:43,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:13:43,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 23:13:43,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 23:13:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 23:13:44,331 INFO L78 Accepts]: Start accepts. Automaton has currently 669 states, but on-demand construction may add more states Word has length 162 [2024-05-30 23:13:44,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:13:44,342 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-05-30 23:13:44,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:44,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:13:44,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:13:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1325345464, now seen corresponding path program 3 times [2024-05-30 23:13:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:13:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487202161] [2024-05-30 23:13:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:13:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:13:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:13:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:13:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:13:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487202161] [2024-05-30 23:13:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487202161] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:13:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29580184] [2024-05-30 23:13:49,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 23:13:49,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:13:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:13:49,545 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-05-30 23:13:49,546 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-05-30 23:13:49,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-30 23:13:49,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:13:49,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 78 conjunts are in the unsatisfiable core [2024-05-30 23:13:49,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:13:50,800 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-05-30 23:13:51,419 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-05-30 23:13:51,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 23:13:51,621 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-05-30 23:13:58,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-30 23:13:58,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:13:58,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 501 treesize of output 249 [2024-05-30 23:14:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 23:14:04,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:14:50,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse85 (* c_~N~0 4))) (let ((.cse17 (= c_~min1~0 c_~min3~0)) (.cse60 (= c_~min2~0 c_~min1~0)) (.cse4 (+ c_~min3~0 1)) (.cse1 (+ .cse85 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (- 8))) (.cse3 (+ .cse85 (- 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse2 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select .cse0 .cse1) .cse2) (< c_~min1~0 (+ .cse2 1)) (< (select .cse0 .cse3) .cse2) (< .cse2 .cse4))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse6 (select .cse5 .cse3)) (.cse7 (select .cse5 .cse1))) (or (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< .cse6 c_~min2~0) (< .cse7 (+ .cse6 1)) (= c_~min2~0 .cse6) (< c_~min1~0 (+ .cse7 1)))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse10 (select .cse8 .cse3))) (or (< (select .cse8 .cse1) .cse9) (< c_~min1~0 (+ .cse9 1)) (< .cse9 (+ .cse10 1)) (= c_~min3~0 .cse10) (< .cse10 c_~min3~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse12 (select .cse11 .cse3))) (or (< (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (select .cse11 .cse1) c_~min1~0) (< c_~min1~0 (+ .cse12 1)) (= c_~min3~0 .cse12) (< .cse12 c_~min3~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse14 (select .cse16 .cse1)) (.cse13 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse15 (select .cse16 .cse3))) (or (< .cse13 (+ .cse14 1)) (= c_~min1~0 .cse14) (< .cse14 c_~min1~0) (< c_~min3~0 (+ .cse15 1)) (< c_~min2~0 (+ .cse13 1)) (< .cse15 c_~min1~0) (= c_~min1~0 .cse15))))) (or .cse17 (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse20 (select .cse19 .cse3)) (.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse18 c_~min1~0) (< (select .cse19 .cse1) .cse18) (< c_~min2~0 (+ .cse18 1)) (< .cse20 c_~min1~0) (< .cse20 c_~min3~0) (< .cse18 .cse4))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse23 (select .cse22 .cse3))) (or (< .cse21 c_~min1~0) (< (select .cse22 .cse1) .cse21) (< c_~min2~0 (+ .cse21 1)) (= c_~min1~0 .cse21) (< .cse23 c_~min1~0) (< .cse23 c_~min3~0))))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse25 (select .cse26 .cse1))) (or (< .cse24 (+ .cse25 1)) (< c_~min1~0 (+ .cse24 1)) (< (select .cse26 .cse3) .cse25) (< .cse25 .cse4))))) (or (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse27 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse28 (select .cse30 .cse1)) (.cse29 (select .cse30 .cse3))) (or (< .cse27 (+ .cse28 1)) (< .cse28 c_~min1~0) (< c_~min2~0 (+ .cse27 1)) (< .cse29 c_~min1~0) (< .cse28 .cse4) (< .cse29 c_~min3~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse34 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse32 (select .cse34 .cse1)) (.cse31 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse33 (select .cse34 .cse3))) (or (< .cse31 (+ .cse32 1)) (= c_~min1~0 .cse32) (< .cse32 c_~min1~0) (< c_~min2~0 (+ .cse31 1)) (< .cse33 c_~min1~0) (< .cse33 c_~min3~0)))))) .cse17) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse35) (< (select .cse36 .cse1) .cse35) (< .cse35 c_~min2~0) (< c_~min1~0 (+ .cse35 1)) (< (select .cse36 .cse3) .cse35))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse38 (select .cse37 .cse3))) (or (< (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< .cse38 c_~min2~0) (< (select .cse37 .cse1) c_~min1~0) (< c_~min1~0 (+ .cse38 1)) (= c_~min2~0 .cse38))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse40 (select .cse39 .cse1))) (or (< (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (= c_~min2~0 .cse40) (< (select .cse39 .cse3) .cse40) (< c_~min1~0 (+ .cse40 1)) (< .cse40 c_~min2~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse42 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse41 (select .cse42 .cse3))) (or (< .cse41 c_~min2~0) (< (select .cse42 .cse1) .cse43) (< c_~min1~0 (+ .cse43 1)) (= c_~min2~0 .cse41) (< .cse43 (+ .cse41 1)))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse46 (select .cse45 .cse3))) (or (< .cse44 c_~min1~0) (< (select .cse45 .cse1) .cse44) (< c_~min3~0 (+ .cse46 1)) (< c_~min2~0 (+ .cse44 1)) (= c_~min1~0 .cse44) (< .cse46 c_~min1~0) (= c_~min1~0 .cse46))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse47 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse48 (select .cse47 .cse1)) (.cse49 (select .cse47 .cse3))) (or (< (select .cse47 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< .cse48 (+ .cse49 1)) (< c_~min1~0 (+ .cse48 1)) (= c_~min3~0 .cse49) (< .cse49 c_~min3~0))))) (or (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse51 (select .cse50 .cse1)) (.cse52 (select .cse50 .cse3))) (or (< (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (= c_~min1~0 .cse51) (< .cse51 c_~min1~0) (< .cse52 c_~min1~0) (< c_~min2~0 (+ .cse51 1)) (< .cse52 c_~min3~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse54 (select .cse53 .cse1)) (.cse55 (select .cse53 .cse3))) (or (< (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (< .cse54 c_~min1~0) (< .cse55 c_~min1~0) (< c_~min2~0 (+ .cse54 1)) (< .cse54 .cse4) (< .cse55 c_~min3~0)))))) .cse17) (or (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse59 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse56 (select .cse59 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse57 (select .cse59 .cse1)) (.cse58 (select .cse59 .cse3))) (or (< .cse56 c_~min1~0) (< .cse56 c_~min2~0) (< .cse57 c_~min1~0) (< .cse58 c_~min1~0) (< .cse57 c_~min2~0) (< .cse58 c_~min3~0))))) (and .cse60 (<= c_~min2~0 c_~min3~0)) (and .cse17 (<= .cse4 c_~min2~0))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse63 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse61 (select .cse63 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse62 (select .cse63 .cse1))) (or (< .cse61 (+ .cse62 1)) (= c_~min2~0 .cse62) (< c_~min1~0 (+ .cse61 1)) (< (select .cse63 .cse3) .cse62) (< .cse62 c_~min2~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse67 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse65 (select .cse67 .cse1)) (.cse64 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse66 (select .cse67 .cse3))) (or (< .cse64 (+ .cse65 1)) (< .cse65 (+ .cse66 1)) (< c_~min1~0 (+ .cse64 1)) (= c_~min3~0 .cse66) (< .cse66 c_~min3~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse71 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse70 (select .cse71 .cse1)) (.cse69 (select .cse71 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse68 (select .cse71 .cse3))) (or (< .cse68 c_~min2~0) (< .cse69 (+ .cse70 1)) (< .cse70 (+ .cse68 1)) (< c_~min1~0 (+ .cse69 1)) (= c_~min2~0 .cse68))))) (or .cse60 (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse75 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse72 (select .cse75 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse73 (select .cse75 .cse3)) (.cse74 (select .cse75 .cse1))) (or (< .cse72 c_~min1~0) (< .cse73 c_~min2~0) (< .cse72 c_~min2~0) (< .cse74 c_~min1~0) (< c_~min3~0 (+ .cse73 1)) (< .cse73 c_~min1~0) (< .cse74 c_~min2~0))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse79 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse76 (select .cse79 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse78 (select .cse79 .cse3)) (.cse77 (select .cse79 .cse1))) (or (< .cse76 c_~min1~0) (< .cse76 c_~min2~0) (< .cse77 c_~min1~0) (< c_~min3~0 (+ .cse78 1)) (< .cse78 c_~min1~0) (= c_~min1~0 .cse78) (< .cse77 c_~min2~0))))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse80 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse81 (select .cse80 .cse1))) (or (< (select .cse80 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (select .cse80 .cse3) .cse81) (< c_~min1~0 (+ .cse81 1)) (< .cse81 .cse4))))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse82 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse84 (select .cse82 .cse3)) (.cse83 (select .cse82 .cse1))) (or (< (select .cse82 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min2~0) (= c_~min1~0 .cse83) (< .cse83 c_~min1~0) (< c_~min3~0 (+ .cse84 1)) (< .cse84 c_~min1~0) (= c_~min1~0 .cse84) (< c_~min2~0 (+ .cse83 1))))))))) is different from false [2024-05-30 23:15:34,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:34,811 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 224 treesize of output 152 [2024-05-30 23:15:34,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:34,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2064 treesize of output 1974 [2024-05-30 23:15:34,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:34,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 495 treesize of output 472 [2024-05-30 23:15:35,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 982 treesize of output 842 [2024-05-30 23:15:35,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:35,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 449 treesize of output 387 [2024-05-30 23:15:36,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:36,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 224 treesize of output 152 [2024-05-30 23:15:36,991 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-05-30 23:15:36,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 994 treesize of output 952 [2024-05-30 23:15:37,117 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:37,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1005 treesize of output 935 [2024-05-30 23:15:37,201 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:37,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 927 treesize of output 779 [2024-05-30 23:15:37,315 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:37,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 402 treesize of output 371 [2024-05-30 23:15:38,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:38,516 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 163 treesize of output 115 [2024-05-30 23:15:38,630 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-05-30 23:15:38,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6234 treesize of output 5925 [2024-05-30 23:15:38,766 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:38,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 328 [2024-05-30 23:15:38,836 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:38,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 320 treesize of output 268 [2024-05-30 23:15:39,332 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:39,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 375 treesize of output 263 [2024-05-30 23:15:39,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:39,476 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 174 [2024-05-30 23:15:39,559 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:39,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2244 treesize of output 2124 [2024-05-30 23:15:39,646 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:39,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1006 treesize of output 826 [2024-05-30 23:15:39,740 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:39,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 392 treesize of output 350 [2024-05-30 23:15:39,816 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:39,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 431 treesize of output 343 [2024-05-30 23:15:40,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:40,927 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 189 treesize of output 129 [2024-05-30 23:15:41,063 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-05-30 23:15:41,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11669 treesize of output 10976 [2024-05-30 23:15:41,151 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:41,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 201 [2024-05-30 23:15:41,365 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:41,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 293 treesize of output 269 [2024-05-30 23:15:41,435 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-05-30 23:15:41,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 205 [2024-05-30 23:15:41,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:41,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 133 [2024-05-30 23:15:41,892 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:41,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13450 treesize of output 12670 [2024-05-30 23:15:41,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:41,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 403 treesize of output 271 [2024-05-30 23:15:42,228 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:42,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 338 [2024-05-30 23:15:42,282 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:42,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 334 treesize of output 264 [2024-05-30 23:15:42,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:42,451 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 177 treesize of output 117 [2024-05-30 23:15:42,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:42,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 593 treesize of output 575 [2024-05-30 23:15:42,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:42,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 559 treesize of output 487 [2024-05-30 23:15:42,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:42,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 471 treesize of output 443 [2024-05-30 23:15:42,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:42,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 217 [2024-05-30 23:15:43,710 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:43,711 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 203 treesize of output 1 [2024-05-30 23:15:43,727 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:43,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 1 [2024-05-30 23:15:43,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:43,746 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 246 treesize of output 162 [2024-05-30 23:15:43,818 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:43,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2052 treesize of output 1952 [2024-05-30 23:15:43,937 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:43,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 491 treesize of output 459 [2024-05-30 23:15:44,015 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:44,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 916 treesize of output 848 [2024-05-30 23:15:44,092 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-05-30 23:15:44,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 844 treesize of output 704 [2024-05-30 23:15:44,660 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:44,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 1 [2024-05-30 23:15:44,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:44,684 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-05-30 23:15:44,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:44,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14367 treesize of output 13695 [2024-05-30 23:15:44,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:44,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 425 treesize of output 325 [2024-05-30 23:15:45,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:45,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 402 treesize of output 389 [2024-05-30 23:15:45,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:45,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 373 treesize of output 331 [2024-05-30 23:15:46,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:46,024 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 211 treesize of output 139 [2024-05-30 23:15:46,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:46,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1707 treesize of output 1637 [2024-05-30 23:15:46,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:46,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 826 treesize of output 726 [2024-05-30 23:15:46,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:46,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 331 [2024-05-30 23:15:46,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:46,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 367 treesize of output 325 [2024-05-30 23:15:47,962 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:47,963 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 222 treesize of output 1 [2024-05-30 23:15:48,000 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:48,001 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 195 treesize of output 1 [2024-05-30 23:15:48,018 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:48,018 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 162 treesize of output 1 [2024-05-30 23:15:48,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:48,044 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 189 treesize of output 129 [2024-05-30 23:15:48,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:48,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1719 treesize of output 1647 [2024-05-30 23:15:48,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:48,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 427 treesize of output 411 [2024-05-30 23:15:48,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:48,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 847 treesize of output 735 [2024-05-30 23:15:48,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:15:48,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 389 treesize of output 341 [2024-05-30 23:15:51,353 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,353 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 222 treesize of output 1 [2024-05-30 23:15:51,371 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,372 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 231 treesize of output 1 [2024-05-30 23:15:51,390 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 1 [2024-05-30 23:15:51,409 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,409 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-05-30 23:15:51,427 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,427 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 163 treesize of output 1 [2024-05-30 23:15:51,445 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,445 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 215 treesize of output 1 [2024-05-30 23:15:51,463 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,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 220 treesize of output 1 [2024-05-30 23:15:51,482 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2024-05-30 23:15:51,500 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-05-30 23:15:51,501 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 198 treesize of output 1 [2024-05-30 23:15:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-30 23:15:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29580184] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:15:56,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:15:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 47, 42] total 119 [2024-05-30 23:15:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679671549] [2024-05-30 23:15:56,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:15:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2024-05-30 23:15:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:15:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2024-05-30 23:15:56,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1041, Invalid=12681, Unknown=88, NotChecked=232, Total=14042 [2024-05-30 23:15:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:15:56,264 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:15:56,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 3.638655462184874) internal successors, (433), 119 states have internal predecessors, (433), 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-05-30 23:15:56,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-30 23:15:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:16:48,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:17:29,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:17:32,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 23:18:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 23:18:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 23:18:13,224 INFO L78 Accepts]: Start accepts. Automaton has currently 696 states, but on-demand construction may add more states Word has length 175 [2024-05-30 23:18:13,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:18:13,230 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-05-30 23:18:13,430 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,SelfDestructingSolverStorable8 [2024-05-30 23:18:13,431 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:18:13,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:18:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1838567162, now seen corresponding path program 4 times [2024-05-30 23:18:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:18:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598491018] [2024-05-30 23:18:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:18:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:18:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:18:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-30 23:18:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:18:15,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598491018] [2024-05-30 23:18:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598491018] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:18:15,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115603522] [2024-05-30 23:18:15,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 23:18:15,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:18:15,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:18:15,098 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-05-30 23:18:15,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-05-30 23:18:15,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 23:18:15,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:18:15,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-30 23:18:15,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:18:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 27 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-30 23:18:19,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:18:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-30 23:18:23,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115603522] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 23:18:23,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 23:18:23,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 48 [2024-05-30 23:18:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395583785] [2024-05-30 23:18:23,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 23:18:23,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-05-30 23:18:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 23:18:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-05-30 23:18:23,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2024-05-30 23:18:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:18:23,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 23:18:23,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.4375) internal successors, (261), 48 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-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-05-30 23:18:23,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:18:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 23:18:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 23:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 23:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 23:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 23:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 23:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-05-30 23:18:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-05-30 23:18:34,769 INFO L78 Accepts]: Start accepts. Automaton has currently 839 states, but on-demand construction may add more states Word has length 180 [2024-05-30 23:18:34,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 23:18:34,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-05-30 23:18:34,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:18:34,971 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 23:18:34,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 23:18:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1149768699, now seen corresponding path program 5 times [2024-05-30 23:18:34,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 23:18:34,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148747101] [2024-05-30 23:18:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 23:18:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 23:18:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 23:19:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:19:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 23:19:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148747101] [2024-05-30 23:19:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148747101] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 23:19:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60837609] [2024-05-30 23:19:20,402 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 23:19:20,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 23:19:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 23:19:20,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 23:19:20,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 23:19:20,543 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-05-30 23:19:20,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 23:19:20,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 76 conjunts are in the unsatisfiable core [2024-05-30 23:19:20,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 23:20:14,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 23:20:14,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 635 treesize of output 299 [2024-05-30 23:20:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 23:20:17,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 23:22:17,754 WARN L293 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 266 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 23:23:01,739 WARN L293 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 266 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 23:23:23,350 WARN L293 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 266 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 23:24:02,425 WARN L293 SmtUtils]: Spent 14.36s on a formula simplification that was a NOOP. DAG size: 342 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 23:25:33,319 WARN L293 SmtUtils]: Spent 14.11s on a formula simplification that was a NOOP. DAG size: 343 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 23:26:15,394 WARN L293 SmtUtils]: Spent 14.43s on a formula simplification that was a NOOP. DAG size: 343 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-30 23:27:28,699 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 23:27:28,705 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 23:27:28,705 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 23:27:29,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-30 23:27:29,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-05-30 23:27:29,900 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-30 23:27:29,976 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-05-30 23:27:29,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-30 23:27:29,976 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.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: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2024-05-30 23:27:30,004 INFO L158 Benchmark]: Toolchain (without parser) took 855295.90ms. Allocated memory was 268.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 194.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 921.9MB. Max. memory is 8.0GB. [2024-05-30 23:27:30,005 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 268.4MB. Free memory is still 238.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 23:27:30,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.85ms. Allocated memory is still 268.4MB. Free memory was 194.7MB in the beginning and 182.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 23:27:30,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.30ms. Allocated memory is still 268.4MB. Free memory was 182.5MB in the beginning and 180.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 23:27:30,005 INFO L158 Benchmark]: Boogie Preprocessor took 17.50ms. Allocated memory is still 268.4MB. Free memory was 180.6MB in the beginning and 179.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 23:27:30,005 INFO L158 Benchmark]: RCFGBuilder took 460.80ms. Allocated memory is still 268.4MB. Free memory was 178.9MB in the beginning and 224.1MB in the end (delta: -45.2MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. [2024-05-30 23:27:30,005 INFO L158 Benchmark]: TraceAbstraction took 854596.25ms. Allocated memory was 268.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 223.0MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 948.8MB. Max. memory is 8.0GB. [2024-05-30 23:27:30,006 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2024-05-30 23:27:30,000 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 137 Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 268.4MB. Free memory is still 238.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.85ms. Allocated memory is still 268.4MB. Free memory was 194.7MB in the beginning and 182.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.30ms. Allocated memory is still 268.4MB. Free memory was 182.5MB in the beginning and 180.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.50ms. Allocated memory is still 268.4MB. Free memory was 180.6MB in the beginning and 179.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 460.80ms. Allocated memory is still 268.4MB. Free memory was 178.9MB in the beginning and 224.1MB in the end (delta: -45.2MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. * TraceAbstraction took 854596.25ms. Allocated memory was 268.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 223.0MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 948.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown