/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 SUFFICIENT -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 20:50:50,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-22 20:50:50,063 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 20:50:50,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-22 20:50:50,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-22 20:50:50,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-22 20:50:50,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-22 20:50:50,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-22 20:50:50,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-22 20:50:50,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-22 20:50:50,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-22 20:50:50,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-22 20:50:50,089 INFO L153 SettingsManager]: * Use SBE=true [2025-01-22 20:50:50,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-22 20:50:50,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-22 20:50:50,089 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-22 20:50:50,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-22 20:50:50,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-22 20:50:50,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-22 20:50:50,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 20:50:50,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-22 20:50:50,108 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-22 20:50:50,108 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 -> SUFFICIENT [2025-01-22 20:50:50,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-22 20:50:50,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-22 20:50:50,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-22 20:50:50,400 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-22 20:50:50,402 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-22 20:50:50,402 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 20:50:50,403 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 20:50:50,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-22 20:50:50,427 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-22 20:50:50,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-22 20:50:50,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-22 20:50:50,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-22 20:50:50,435 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,440 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,444 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-22 20:50:50,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-22 20:50:50,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-22 20:50:50,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-22 20:50:50,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-22 20:50:50,451 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,451 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,452 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,452 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,453 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,454 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,457 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,458 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,459 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-22 20:50:50,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-22 20:50:50,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-22 20:50:50,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-22 20:50:50,462 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 08:50:50" (1/1) ... [2025-01-22 20:50:50,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-22 20:50:50,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 20:50:50,492 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 20:50:50,504 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 20:50:50,527 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-22 20:50:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-22 20:50:50,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-22 20:50:50,528 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-22 20:50:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-22 20:50:50,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-22 20:50:50,528 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-22 20:50:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-22 20:50:50,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-22 20:50:50,528 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-22 20:50:50,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-22 20:50:50,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-22 20:50:50,529 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-01-22 20:50:50,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-22 20:50:50,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-22 20:50:50,530 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 20:50:50,567 INFO L234 CfgBuilder]: Building ICFG [2025-01-22 20:50:50,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-22 20:50:50,642 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-22 20:50:50,642 INFO L283 CfgBuilder]: Performing block encoding [2025-01-22 20:50:50,675 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-22 20:50:50,675 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-22 20:50:50,676 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.01 08:50:50 BoogieIcfgContainer [2025-01-22 20:50:50,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-22 20:50:50,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-22 20:50:50,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-22 20:50:50,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-22 20:50:50,681 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 08:50:50" (1/2) ... [2025-01-22 20:50:50,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75203c1f and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.01 08:50:50, skipping insertion in model container [2025-01-22 20:50:50,683 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 08:50:50" (2/2) ... [2025-01-22 20:50:50,684 INFO L128 eAbstractionObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2025-01-22 20:50:50,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-22 20:50:50,695 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 20:50:50,695 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-22 20:50:50,743 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-22 20:50:50,771 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 20:50:50,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-22 20:50:50,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 20:50:50,773 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 20:50:50,775 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 20:50:50,824 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-22 20:50:50,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-22 20:50:50,845 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;@20718d43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-22 20:50:50,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-22 20:50:51,234 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 20:50:51,234 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 20:50:51,234 INFO L139 ounterexampleChecker]: Examining path program with hash -1417647694, occurence #1 [2025-01-22 20:50:51,234 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 20:50:51,234 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 20:50:51,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:50:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2087246828, now seen corresponding path program 1 times [2025-01-22 20:50:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 20:50:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193224485] [2025-01-22 20:50:51,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 20:50:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:50:51,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-22 20:50:51,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-22 20:50:51,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 20:50:51,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:50:51,398 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 20:50:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 20:50:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193224485] [2025-01-22 20:50:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193224485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 20:50:51,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 20:50:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-22 20:50:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044464993] [2025-01-22 20:50:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 20:50:51,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-22 20:50:51,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 20:50:51,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-22 20:50:51,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-22 20:50:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:50:51,421 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 20:50:51,422 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 20:50:51,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:50:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:50:51,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-22 20:50:51,542 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 20:50:51,542 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 20:50:51,542 INFO L139 ounterexampleChecker]: Examining path program with hash 762591382, occurence #1 [2025-01-22 20:50:51,542 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 20:50:51,542 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 20:50:51,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:50:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash -571498906, now seen corresponding path program 1 times [2025-01-22 20:50:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 20:50:51,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556856501] [2025-01-22 20:50:51,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 20:50:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:50:51,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-22 20:50:51,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-22 20:50:51,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 20:50:51,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:50:51,674 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 20:50:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 20:50:51,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556856501] [2025-01-22 20:50:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556856501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-22 20:50:51,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-22 20:50:51,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-22 20:50:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834377521] [2025-01-22 20:50:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-22 20:50:51,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-22 20:50:51,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 20:50:51,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-22 20:50:51,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-22 20:50:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:50:51,677 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 20:50:51,677 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 20:50:51,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:50:51,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:50:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:50:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:50:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-22 20:50:51,858 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 20:50:51,858 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 20:50:51,858 INFO L139 ounterexampleChecker]: Examining path program with hash 1796517660, occurence #1 [2025-01-22 20:50:51,858 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 20:50:51,858 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 20:50:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:50:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1472607756, now seen corresponding path program 2 times [2025-01-22 20:50:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 20:50:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117578152] [2025-01-22 20:50:51,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 20:50:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:50:51,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-22 20:50:51,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-22 20:50:51,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 20:50:51,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:50:52,198 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 20:50:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 20:50:52,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117578152] [2025-01-22 20:50:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117578152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 20:50:52,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358352704] [2025-01-22 20:50:52,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-22 20:50:52,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 20:50:52,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 20:50:52,201 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 20:50:52,206 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 20:50:52,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-22 20:50:52,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-22 20:50:52,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-22 20:50:52,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:50:52,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-22 20:50:52,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 20:50:52,422 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 20:50:52,482 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 20:50:52,545 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 20:50:52,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 20:50:52,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:50:52,599 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 20:50:52,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:50:52,661 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 20:50:52,744 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 20:50:52,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358352704] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 20:50:52,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 20:50:52,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2025-01-22 20:50:52,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460254213] [2025-01-22 20:50:52,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 20:50:52,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-22 20:50:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 20:50:52,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-22 20:50:52,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-01-22 20:50:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:50:52,746 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 20:50:52,746 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 20:50:52,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:50:52,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:50:52,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:50:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:50:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:50:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 20:50:53,637 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 20:50:53,830 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 20:50:53,831 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 20:50:53,831 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 20:50:53,831 INFO L139 ounterexampleChecker]: Examining path program with hash 751824385, occurence #1 [2025-01-22 20:50:53,831 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 20:50:53,832 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 20:50:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:50:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1876424242, now seen corresponding path program 3 times [2025-01-22 20:50:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 20:50:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870926673] [2025-01-22 20:50:53,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 20:50:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:50:53,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-01-22 20:50:53,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-22 20:50:53,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 20:50:53,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:50:54,318 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 20:50:54,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 20:50:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870926673] [2025-01-22 20:50:54,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870926673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 20:50:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950182946] [2025-01-22 20:50:54,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-22 20:50:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 20:50:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 20:50:54,322 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 20:50:54,326 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 20:50:54,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-01-22 20:50:54,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-01-22 20:50:54,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-22 20:50:54,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:50:54,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-22 20:50:54,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 20:50:54,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-22 20:50:54,878 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:50:54,878 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 20:50:54,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:50:54,987 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 20:50:55,058 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 20:50:55,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 20:50:55,428 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:50:55,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:50:55,445 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 20:50:55,802 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2025-01-22 20:50:55,803 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 20:50:56,111 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 20:50:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950182946] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 20:50:56,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 20:50:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2025-01-22 20:50:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969787352] [2025-01-22 20:50:56,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 20:50:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-22 20:50:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 20:50:56,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-22 20:50:56,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2025-01-22 20:50:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:50:56,113 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 20:50:56,113 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 20:50:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:50:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:50:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 20:50:56,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:51:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:51:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:51:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 20:51:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 20:51:03,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-22 20:51:03,528 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 20:51:03,528 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 20:51:03,528 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 20:51:03,529 INFO L139 ounterexampleChecker]: Examining path program with hash 751824385, occurence #2 [2025-01-22 20:51:03,529 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-22 20:51:03,530 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 44 [2025-01-22 20:51:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:51:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 728053896, now seen corresponding path program 1 times [2025-01-22 20:51:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-22 20:51:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770206292] [2025-01-22 20:51:03,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-22 20:51:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:51:03,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-22 20:51:03,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-22 20:51:03,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-22 20:51:03,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-22 20:51:03,601 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-01-22 20:51:03,602 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-01-22 20:51:03,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 51 [2025-01-22 20:51:03,602 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-22 20:51:03,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-01-22 20:51:03,602 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-22 20:51:03,602 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-22 20:51:03,602 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 20:51:03,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:51:03,602 INFO L85 PathProgramCache]: Analyzing trace with hash 51539966, now seen corresponding path program 4 times [2025-01-22 20:51:03,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 20:51:03,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641592634] [2025-01-22 20:51:03,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 20:51:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:51:03,607 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-22 20:51:03,632 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 20:51:03,632 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 20:51:03,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:51:04,396 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 20:51:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 20:51:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641592634] [2025-01-22 20:51:04,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641592634] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 20:51:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077078537] [2025-01-22 20:51:04,396 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-22 20:51:04,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 20:51:04,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 20:51:04,399 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 20:51:04,412 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 20:51:04,433 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-22 20:51:04,446 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 20:51:04,446 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-22 20:51:04,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:51:04,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-22 20:51:04,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 20:51:05,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:51:05,565 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 20:51:05,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:51:05,679 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 20:51:05,757 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 20:51:05,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 20:51:07,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:51:07,027 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 20:51:08,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:51:08,551 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 20:51:09,561 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 20:51:09,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077078537] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 20:51:09,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 20:51:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 27] total 68 [2025-01-22 20:51:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905665675] [2025-01-22 20:51:09,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 20:51:09,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-01-22 20:51:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 20:51:09,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-01-22 20:51:09,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=4239, Unknown=0, NotChecked=0, Total=4692 [2025-01-22 20:51:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:51:09,565 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 20:51:09,565 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 20:51:09,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:51:09,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:51:09,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 20:51:09,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2025-01-22 20:51:09,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:51:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:51:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:51:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 20:51:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 20:51:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-01-22 20:51:33,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-22 20:51:33,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 20:51:33,596 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 20:51:33,596 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 20:51:33,597 INFO L139 ounterexampleChecker]: Examining path program with hash 147404875, occurence #1 [2025-01-22 20:51:33,597 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 20:51:33,597 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 20:51:33,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:51:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash -524246657, now seen corresponding path program 5 times [2025-01-22 20:51:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 20:51:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026004330] [2025-01-22 20:51:33,597 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 20:51:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:51:33,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 10 equivalence classes. [2025-01-22 20:51:33,683 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 112 statements. [2025-01-22 20:51:33,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-22 20:51:33,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:51:36,296 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 20:51:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 20:51:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026004330] [2025-01-22 20:51:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026004330] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 20:51:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627476333] [2025-01-22 20:51:36,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-22 20:51:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 20:51:36,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 20:51:36,299 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 20:51:36,300 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 20:51:36,329 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 10 equivalence classes. [2025-01-22 20:51:36,365 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 112 statements. [2025-01-22 20:51:36,365 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-22 20:51:36,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:51:36,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-01-22 20:51:36,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 20:51:42,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:51:42,748 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 20:51:43,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:51:43,513 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 20:51:43,696 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 20:51:43,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 20:51:53,686 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,686 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,687 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,687 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,692 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,696 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,696 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,697 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,697 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,699 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,700 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,700 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,701 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,702 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,703 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,703 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,704 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,704 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,706 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,708 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,710 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,710 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,710 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,711 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,712 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,715 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,716 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,717 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,718 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,719 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,719 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,719 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,720 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,721 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:53,721 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:51:54,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:51:54,097 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 20:53:13,752 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:13,816 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:13,935 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:13,987 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:14,092 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:14,321 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:14,434 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:14,669 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:14,724 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:14,840 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:15,367 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:15,636 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:15,914 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:16,479 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:17,722 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:18,864 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:19,090 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:19,230 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:20,378 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:20,629 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:21,813 WARN L672 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-01-22 20:53:27,650 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:28,827 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:29,068 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:29,134 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:29,249 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:29,491 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:30,648 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:30,763 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:30,875 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:32,058 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:32,293 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:33,434 WARN L672 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-01-22 20:53:39,380 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:40,646 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:40,903 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:40,974 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:41,106 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:41,378 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:42,647 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:42,763 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:42,819 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:42,979 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:43,095 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:43,328 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:44,468 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:44,978 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:45,207 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:45,298 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:45,830 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:46,357 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:47,543 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:47,819 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:48,336 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:53:49,473 WARN L672 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-01-22 20:53:52,049 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:52,307 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:52,423 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:52,663 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:52,773 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:53,000 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:53,228 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:53,343 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:53,469 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:53,515 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:53,617 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:53,849 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:53,962 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:54,063 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:54,292 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:54,514 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:55,069 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:53:55,093 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:55,140 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:55,246 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:55,301 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:53:55,329 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-22 20:53:55,341 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:55,386 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:53:55,421 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:55,523 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:55,574 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:53:55,593 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:55,648 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:55,694 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:55,798 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:55,898 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:56,137 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:56,244 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:56,349 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:56,577 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:56,621 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:56,725 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:56,953 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:57,175 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:57,280 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:57,776 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:58,001 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:58,103 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:53:58,336 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:58,451 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:58,549 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:58,652 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:53:59,150 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:59,254 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:59,354 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:59,503 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:53:59,530 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:59,632 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:53:59,660 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:53:59,708 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:53:59,731 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:59,851 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:53:59,953 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:54:00,468 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:00,515 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:00,743 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:00,964 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:01,185 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:01,406 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-01-22 20:54:01,499 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:01,608 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:01,716 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:01,788 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:01,835 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:01,933 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:02,154 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:02,268 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:02,376 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:02,430 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:54:02,451 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:02,508 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:02,555 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:54:02,582 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:02,628 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:02,738 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:54:02,763 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-01-22 20:54:02,775 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:02,829 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:54:02,879 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:02,986 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:03,086 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:03,131 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:03,359 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:03,462 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:03,505 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:03,606 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:54:03,625 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:03,670 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:03,899 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:03,985 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:54:04,494 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:04,606 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:04,833 WARN L672 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-01-22 20:54:05,979 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:54:06,477 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:06,581 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:06,679 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:54:07,210 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:07,326 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-01-22 20:54:07,847 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:07,959 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:08,183 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:08,287 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:08,393 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:08,497 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:08,605 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:08,829 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:08,934 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:08,992 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:09,093 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:09,196 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:09,292 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:09,409 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:09,515 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:09,617 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:09,665 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:09,762 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-01-22 20:54:09,994 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:10,043 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-01-22 20:54:10,067 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:10,118 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:10,216 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:10,261 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-01-22 20:54:10,363 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-01-22 20:54:11,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,192 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,197 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,198 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,200 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,202 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,209 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,210 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,210 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,211 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,211 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,211 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,212 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,213 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,213 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,215 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,215 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,216 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,216 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,219 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,220 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,226 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,228 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,228 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,229 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,229 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,230 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:54:11,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:54:11,455 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 20:54:15,643 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 20:54:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627476333] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-22 20:54:15,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-22 20:54:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 58, 58] total 139 [2025-01-22 20:54:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107480714] [2025-01-22 20:54:15,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-22 20:54:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 140 states [2025-01-22 20:54:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-22 20:54:15,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2025-01-22 20:54:15,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1864, Invalid=17596, Unknown=0, NotChecked=0, Total=19460 [2025-01-22 20:54:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:54:15,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-22 20:54:15,648 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 20:54:15,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:54:15,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:54:15,648 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-01-22 20:54:15,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2025-01-22 20:54:15,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 206 states. [2025-01-22 20:54:15,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-22 20:56:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-22 20:56:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-22 20:56:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-22 20:56:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-22 20:56:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-01-22 20:56:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2025-01-22 20:56:55,561 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 20:56:55,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 20:56:55,756 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 20:56:55,756 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-22 20:56:55,756 INFO L139 ounterexampleChecker]: Examining path program with hash 1561645207, occurence #1 [2025-01-22 20:56:55,756 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-22 20:56:55,756 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-22 20:56:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-22 20:56:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2044072488, now seen corresponding path program 6 times [2025-01-22 20:56:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-22 20:56:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892125477] [2025-01-22 20:56:55,757 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 20:56:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-22 20:56:55,766 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 12 equivalence classes. [2025-01-22 20:56:55,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 139 of 139 statements. [2025-01-22 20:56:55,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-01-22 20:56:55,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:56:59,210 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 20:56:59,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-22 20:56:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892125477] [2025-01-22 20:56:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892125477] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-22 20:56:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349084216] [2025-01-22 20:56:59,210 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-22 20:56:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 20:56:59,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-22 20:56:59,213 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 20:56:59,213 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 20:56:59,246 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 12 equivalence classes. [2025-01-22 20:56:59,304 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 139 of 139 statements. [2025-01-22 20:56:59,304 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-01-22 20:56:59,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-22 20:56:59,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-01-22 20:56:59,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-22 20:57:10,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:57:10,424 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 20:57:12,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:57:12,257 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 20:57:12,475 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 20:57:12,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-22 20:57:29,629 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,631 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,631 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,632 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,634 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,635 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,635 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,636 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,640 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,641 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,641 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,644 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,645 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,649 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,651 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,652 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,652 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,653 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,653 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,654 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,656 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,656 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,656 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,658 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,659 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,660 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,660 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,663 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,665 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,665 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,665 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,666 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,667 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,667 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,668 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,668 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,669 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,669 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,669 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,671 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,673 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,674 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,674 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,675 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,675 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,675 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,676 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,681 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,682 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,682 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:29,686 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-22 20:57:30,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:57:30,179 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 20:57:59,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-22 20:57:59,986 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 21:00:15,375 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 21:00:15,376 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 21:00:15,377 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-01-22 21:00:15,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-22 21:00:15,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-22 21:00:15,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-22 21:00:15,585 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 21:00:15,594 INFO L158 Benchmark]: Toolchain (without parser) took 565166.81ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 81.5MB in the beginning and 852.2MB in the end (delta: -770.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2025-01-22 21:00:15,594 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 21:00:15,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.49ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 21:00:15,594 INFO L158 Benchmark]: Boogie Preprocessor took 12.79ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.5MB in the end (delta: 699.2kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-22 21:00:15,594 INFO L158 Benchmark]: RCFGBuilder took 216.00ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 68.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-22 21:00:15,595 INFO L158 Benchmark]: TraceAbstraction took 564915.50ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 67.6MB in the beginning and 852.2MB in the end (delta: -784.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2025-01-22 21:00:15,597 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.22ms. Allocated memory is still 117.4MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 17.49ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 12.79ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.5MB in the end (delta: 699.2kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 216.00ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 68.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 564915.50ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 67.6MB in the beginning and 852.2MB in the end (delta: -784.6MB). Peak memory consumption was 1.1GB. 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...