/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-22 18:44:00,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-22 18:44:00,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-22 18:44:00,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-22 18:44:00,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-22 18:44:00,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-22 18:44:00,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-22 18:44:00,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-22 18:44:00,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-22 18:44:00,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-22 18:44:00,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-22 18:44:00,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-22 18:44:00,269 INFO L153 SettingsManager]: * Use SBE=true [2025-01-22 18:44:00,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-22 18:44:00,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-22 18:44:00,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-22 18:44:00,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-22 18:44:00,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-22 18:44:00,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 18:44:00,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-22 18:44:00,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-22 18:44:00,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-01-22 18:44:00,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-22 18:44:00,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-22 18:44:00,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-22 18:44:00,521 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-22 18:44:00,523 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-22 18:44:00,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2025-01-22 18:44:00,524 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2025-01-22 18:44:00,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-22 18:44:00,545 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-22 18:44:00,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-22 18:44:00,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-22 18:44:00,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-22 18:44:00,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,563 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-22 18:44:00,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-22 18:44:00,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-22 18:44:00,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-22 18:44:00,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-22 18:44:00,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-22 18:44:00,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-22 18:44:00,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-22 18:44:00,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-22 18:44:00,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/1) ... [2025-01-22 18:44:00,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 18:44:00,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 18:44:00,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-22 18:44:00,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-22 18:44:00,626 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-22 18:44:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-22 18:44:00,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-22 18:44:00,626 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-22 18:44:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-22 18:44:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-22 18:44:00,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-22 18:44:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-22 18:44:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-22 18:44:00,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-22 18:44:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-22 18:44:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-22 18:44:00,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-01-22 18:44:00,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-22 18:44:00,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-22 18:44:00,628 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-22 18:44:00,665 INFO L234 CfgBuilder]: Building ICFG [2025-01-22 18:44:00,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-22 18:44:00,738 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-22 18:44:00,738 INFO L283 CfgBuilder]: Performing block encoding [2025-01-22 18:44:00,766 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-22 18:44:00,766 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-22 18:44:00,766 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 06:44:00 BoogieIcfgContainer [2025-01-22 18:44:00,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-22 18:44:00,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-22 18:44:00,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-22 18:44:00,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-22 18:44:00,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.01 06:44:00" (1/2) ... [2025-01-22 18:44:00,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2659df7e and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.01 06:44:00, skipping insertion in model container [2025-01-22 18:44:00,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 06:44:00" (2/2) ... [2025-01-22 18:44:00,777 INFO L128 eAbstractionObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2025-01-22 18:44:00,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-22 18:44:00,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prod-cons3.wvr.bpl that has 5 procedures, 28 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-22 18:44:00,787 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-22 18:44:00,817 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-22 18:44:00,850 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 18:44:00,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-22 18:44:00,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 18:44:00,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-22 18:44:00,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-22 18:44:00,908 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-22 18:44:00,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-22 18:44:00,922 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@2a53ed7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 18:44:00,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-22 18:44:01,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 18:44:01,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 18:44:01,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2087246828, now seen corresponding path program 1 times [2025-01-22 18:44:01,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 18:44:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735231045] [2025-01-22 18:44:01,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 18:44:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 18:44:01,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-22 18:44:01,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-22 18:44:01,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 18:44:01,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 18:44:01,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735231045] [2025-01-22 18:44:01,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735231045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 18:44:01,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 18:44:01,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-22 18:44:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873203841] [2025-01-22 18:44:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 18:44:01,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-22 18:44:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 18:44:01,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-22 18:44:01,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-22 18:44:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:01,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 18:44:01,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 18:44:01,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:01,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-22 18:44:01,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 18:44:01,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 18:44:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash -571498906, now seen corresponding path program 1 times [2025-01-22 18:44:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 18:44:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600405329] [2025-01-22 18:44:01,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 18:44:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 18:44:01,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-22 18:44:01,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-22 18:44:01,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 18:44:01,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 18:44:01,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600405329] [2025-01-22 18:44:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600405329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 18:44:01,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 18:44:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-22 18:44:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823629536] [2025-01-22 18:44:01,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 18:44:01,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-22 18:44:01,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 18:44:01,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-22 18:44:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-22 18:44:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:01,673 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 18:44:01,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 18:44:01,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:01,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:44:01,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-22 18:44:01,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 18:44:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 18:44:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1472607756, now seen corresponding path program 2 times [2025-01-22 18:44:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 18:44:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285053506] [2025-01-22 18:44:01,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 18:44:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 18:44:01,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-22 18:44:01,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-22 18:44:01,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 18:44:01,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 18:44:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285053506] [2025-01-22 18:44:02,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285053506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 18:44:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040211065] [2025-01-22 18:44:02,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 18:44:02,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:44:02,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 18:44:02,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 18:44:02,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-22 18:44:02,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-22 18:44:02,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-22 18:44:02,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 18:44:02,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:02,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-22 18:44:02,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 18:44:02,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-22 18:44:02,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-22 18:44:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:02,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 18:44:02,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:02,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-01-22 18:44:02,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:02,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-22 18:44:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:02,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040211065] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 18:44:02,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 18:44:02,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2025-01-22 18:44:02,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307487543] [2025-01-22 18:44:02,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 18:44:02,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-22 18:44:02,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 18:44:02,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-22 18:44:02,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-01-22 18:44:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:02,775 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 18:44:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 18:44:02,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:02,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:44:02,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:44:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 18:44:03,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-22 18:44:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:44:03,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 18:44:03,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 18:44:03,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1876424242, now seen corresponding path program 3 times [2025-01-22 18:44:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 18:44:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935906495] [2025-01-22 18:44:03,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 18:44:03,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 18:44:03,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-01-22 18:44:03,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-22 18:44:03,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 18:44:03,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 18:44:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935906495] [2025-01-22 18:44:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935906495] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 18:44:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870573114] [2025-01-22 18:44:04,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 18:44:04,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:44:04,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 18:44:04,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 18:44:04,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-22 18:44:04,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-01-22 18:44:04,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-22 18:44:04,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 18:44:04,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:04,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-22 18:44:04,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 18:44:04,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 18:44:04,885 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:04,886 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-01-22 18:44:04,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:04,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2025-01-22 18:44:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:05,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 18:44:05,405 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:05,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:05,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 59 [2025-01-22 18:44:05,754 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-01-22 18:44:05,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 80 [2025-01-22 18:44:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870573114] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 18:44:06,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 18:44:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2025-01-22 18:44:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340343971] [2025-01-22 18:44:06,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 18:44:06,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-22 18:44:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 18:44:06,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-22 18:44:06,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2025-01-22 18:44:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:06,068 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 18:44:06,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 18:44:06,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:06,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:44:06,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 18:44:06,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:44:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 18:44:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 18:44:12,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-22 18:44:12,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:44:12,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 18:44:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 18:44:12,930 INFO L85 PathProgramCache]: Analyzing trace with hash 51539966, now seen corresponding path program 4 times [2025-01-22 18:44:12,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 18:44:12,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473845838] [2025-01-22 18:44:12,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 18:44:12,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 18:44:12,933 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-22 18:44:12,971 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-22 18:44:12,971 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 18:44:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-22 18:44:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 18:44:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473845838] [2025-01-22 18:44:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473845838] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 18:44:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479844042] [2025-01-22 18:44:13,719 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 18:44:13,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:44:13,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 18:44:13,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 18:44:13,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-22 18:44:13,745 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-22 18:44:13,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-22 18:44:13,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 18:44:13,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:13,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-22 18:44:13,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 18:44:14,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:14,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 43 [2025-01-22 18:44:14,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:14,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 22 [2025-01-22 18:44:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:14,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 18:44:16,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:16,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 195 [2025-01-22 18:44:17,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:17,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 56 treesize of output 180 [2025-01-22 18:44:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:18,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479844042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 18:44:18,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 18:44:18,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 27] total 68 [2025-01-22 18:44:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076457119] [2025-01-22 18:44:18,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 18:44:18,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-01-22 18:44:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 18:44:18,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-01-22 18:44:18,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=4239, Unknown=0, NotChecked=0, Total=4692 [2025-01-22 18:44:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:18,394 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 18:44:18,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 68 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 18:44:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:44:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 18:44:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2025-01-22 18:44:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:44:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:44:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:44:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 18:44:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 18:44:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-01-22 18:44:40,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-22 18:44:40,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:44:40,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 18:44:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 18:44:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash -524246657, now seen corresponding path program 5 times [2025-01-22 18:44:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 18:44:40,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386509894] [2025-01-22 18:44:40,578 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 18:44:40,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 18:44:40,583 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 10 equivalence classes. [2025-01-22 18:44:40,653 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 112 statements. [2025-01-22 18:44:40,654 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-22 18:44:40,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 11 proven. 229 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-22 18:44:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 18:44:42,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386509894] [2025-01-22 18:44:42,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386509894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 18:44:42,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098066490] [2025-01-22 18:44:42,963 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 18:44:42,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:44:42,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 18:44:42,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 18:44:42,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-22 18:44:42,990 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 10 equivalence classes. [2025-01-22 18:44:43,019 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 112 statements. [2025-01-22 18:44:43,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-22 18:44:43,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:44:43,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-01-22 18:44:43,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 18:44:48,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:48,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 145 treesize of output 85 [2025-01-22 18:44:49,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:49,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 42 [2025-01-22 18:44:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:44:49,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 18:44:58,904 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,905 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,905 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,906 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,910 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,913 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,913 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,914 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,914 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,916 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,916 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,916 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,917 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,918 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,918 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,919 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,920 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,920 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,923 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,924 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,925 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,925 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,926 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,926 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,930 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,930 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,931 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,932 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,933 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,933 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,933 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:58,935 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:44:59,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:44:59,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 100 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 53 case distinctions, treesize of input 159 treesize of output 619 [2025-01-22 18:46:15,195 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:15,254 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:15,366 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:15,423 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:15,535 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:15,758 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:15,868 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:16,105 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:16,159 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:16,266 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:16,763 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:17,001 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:17,235 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:17,742 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:18,882 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:20,021 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:20,242 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:20,380 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:21,506 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:21,732 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:22,862 WARN L672 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-01-22 18:46:28,474 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:29,584 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:29,810 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:29,871 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:29,979 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:30,212 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:31,337 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:31,445 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:31,522 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:32,633 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:32,863 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:33,995 WARN L672 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-01-22 18:46:39,647 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:40,774 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:41,002 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:41,065 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:41,174 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:41,406 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:42,530 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:42,642 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:42,700 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:42,868 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:42,981 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:43,214 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:44,334 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:44,831 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:45,057 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:45,144 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:45,653 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:46,156 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:47,266 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:47,515 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:48,018 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:46:49,131 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 18:46:51,632 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:51,862 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:51,972 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:52,210 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:52,313 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:52,537 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:52,759 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:52,866 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:52,988 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:53,032 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:53,130 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:53,355 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:53,467 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:53,564 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:53,787 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:54,000 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:54,512 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:46:54,534 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:54,580 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:54,679 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:54,732 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:46:54,754 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-22 18:46:54,765 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:54,810 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:46:54,843 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:54,941 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:54,990 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:46:55,009 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:55,063 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:55,109 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:55,209 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:55,304 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:55,540 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:55,642 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:55,744 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:55,961 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:56,006 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:56,107 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:56,330 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:56,561 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:56,663 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:57,148 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:57,381 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:57,480 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:46:57,712 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:57,827 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:57,944 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:58,050 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:58,600 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:58,751 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:58,846 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:58,992 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:46:59,020 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:59,125 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:46:59,156 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:59,204 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:46:59,226 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:59,339 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:46:59,437 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:46:59,930 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:46:59,974 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:00,189 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:00,401 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:00,618 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:00,831 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-22 18:47:00,925 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:01,030 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:01,134 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:01,202 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:01,246 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:01,342 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:01,567 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:01,675 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:01,778 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:01,833 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:47:01,853 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:01,913 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:01,959 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:47:01,986 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:02,031 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:02,142 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:47:02,168 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-22 18:47:02,181 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:02,230 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:47:02,283 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:02,395 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:02,500 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:02,547 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:02,767 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:02,871 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:02,913 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:03,012 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:47:03,031 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:03,075 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:03,293 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:03,378 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:47:03,873 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:03,982 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:04,200 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 18:47:05,307 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:47:05,794 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:05,896 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:05,991 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:47:06,498 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:06,594 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 18:47:07,102 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:07,214 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:07,433 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:07,545 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:07,646 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:07,747 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:07,855 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:08,080 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,183 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:08,239 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,336 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,440 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,534 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,647 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,750 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,850 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:08,897 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:08,992 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 18:47:09,218 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:09,266 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 18:47:09,290 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:09,334 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:09,430 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:09,475 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 18:47:09,574 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 18:47:10,304 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,305 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,305 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,306 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,306 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,307 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,307 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,307 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,308 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,308 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,309 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,311 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,313 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,315 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,320 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,320 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,320 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,322 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,322 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,322 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,323 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,325 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,325 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,329 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,329 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,335 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,337 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,337 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,338 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,338 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,339 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:47:10,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:47:10,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 108 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 123 treesize of output 487 [2025-01-22 18:47:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 1 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:47:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098066490] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 18:47:14,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 18:47:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 58, 58] total 139 [2025-01-22 18:47:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164490] [2025-01-22 18:47:14,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 18:47:14,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2025-01-22 18:47:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 18:47:14,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2025-01-22 18:47:14,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1864, Invalid=17596, Unknown=0, NotChecked=0, Total=19460 [2025-01-22 18:47:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:47:14,657 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 18:47:14,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 140 states, 140 states have (on average 1.8928571428571428) internal successors, (265), 139 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-22 18:47:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:47:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:47:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 18:47:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2025-01-22 18:47:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 206 states. [2025-01-22 18:47:14,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 18:49:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 18:49:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 18:49:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 18:49:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 18:49:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-01-22 18:49:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2025-01-22 18:49:49,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-22 18:49:49,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:49:49,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-22 18:49:49,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 18:49:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2044072488, now seen corresponding path program 6 times [2025-01-22 18:49:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 18:49:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127594442] [2025-01-22 18:49:49,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 18:49:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 18:49:49,412 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 12 equivalence classes. [2025-01-22 18:49:49,479 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 139 of 139 statements. [2025-01-22 18:49:49,480 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-01-22 18:49:49,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:49:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 0 proven. 463 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-22 18:49:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 18:49:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127594442] [2025-01-22 18:49:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127594442] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 18:49:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488322108] [2025-01-22 18:49:52,677 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 18:49:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:49:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 18:49:52,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-22 18:49:52,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-22 18:49:52,704 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 12 equivalence classes. [2025-01-22 18:49:52,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 139 of 139 statements. [2025-01-22 18:49:52,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-01-22 18:49:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 18:49:52,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-01-22 18:49:52,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 18:50:02,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:50:02,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 211 treesize of output 127 [2025-01-22 18:50:04,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:50:04,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 134 treesize of output 50 [2025-01-22 18:50:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 0 proven. 557 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-22 18:50:04,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 18:50:20,755 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,757 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,757 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,758 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,758 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,760 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,761 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,761 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,761 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,764 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,766 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,766 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,767 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,767 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,767 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,770 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,770 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,770 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,771 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,771 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,771 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,772 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,773 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,773 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,775 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,775 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,776 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,776 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,779 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,780 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,780 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,780 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,781 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,782 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,782 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,782 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,783 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,783 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,783 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,784 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,785 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,786 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,787 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,787 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,788 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,788 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,788 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,789 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,793 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,793 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,794 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:20,796 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 18:50:21,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:50:21,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 22 select indices, 22 select index equivalence classes, 165 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 197 treesize of output 751 [2025-01-22 18:50:49,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 18:50:49,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 140 treesize of output 1244 [2025-01-22 18:52:58,978 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-01-22 18:52:58,978 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-22 18:52:58,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2025-01-22 18:52:58,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-22 18:52:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 18:52:59,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-01-22 18:52:59,186 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.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.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 70 more [2025-01-22 18:52:59,189 INFO L158 Benchmark]: Toolchain (without parser) took 538643.77ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 82.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 969.7MB. Max. memory is 16.0GB. [2025-01-22 18:52:59,189 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 18:52:59,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.90ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 18:52:59,190 INFO L158 Benchmark]: Boogie Preprocessor took 9.93ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.9MB in the end (delta: 669.9kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 18:52:59,190 INFO L158 Benchmark]: RCFGBuilder took 191.32ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 68.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-22 18:52:59,190 INFO L158 Benchmark]: TraceAbstraction took 538421.00ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 67.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 961.3MB. Max. memory is 16.0GB. [2025-01-22 18:52:59,191 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 17.90ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 9.93ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.9MB in the end (delta: 669.9kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 191.32ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 68.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 538421.00ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 67.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 961.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...