/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 NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/context1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 12:44:51,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 12:44:51,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 12:44:51,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 12:44:51,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 12:44:51,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 12:44:51,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 12:44:51,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 12:44:51,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 12:44:51,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 12:44:51,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 12:44:51,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 12:44:51,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 12:44:51,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:44:51,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:44:51,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:44:51,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 12:44:51,078 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 12:44:51,078 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 -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-04-25 12:44:51,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 12:44:51,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 12:44:51,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 12:44:51,314 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 12:44:51,316 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 12:44:51,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/context1.wvr.bpl [2025-04-25 12:44:51,317 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/context1.wvr.bpl' [2025-04-25 12:44:51,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 12:44:51,330 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 12:44:51,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 12:44:51,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 12:44:51,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 12:44:51,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,360 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 12:44:51,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 12:44:51,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 12:44:51,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 12:44:51,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 12:44:51,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 12:44:51,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 12:44:51,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 12:44:51,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 12:44:51,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/1) ... [2025-04-25 12:44:51,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:44:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:44:51,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 12:44:51,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 12:44:51,431 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 12:44:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 12:44:51,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 12:44:51,431 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 12:44:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 12:44:51,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 12:44:51,431 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 12:44:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 12:44:51,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 12:44:51,432 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 12:44:51,465 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 12:44:51,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 12:44:51,533 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 12:44:51,533 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 12:44:51,555 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 12:44:51,556 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-25 12:44:51,556 INFO L201 PluginConnector]: Adding new model context1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:44:51 BoogieIcfgContainer [2025-04-25 12:44:51,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 12:44:51,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 12:44:51,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 12:44:51,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 12:44:51,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:44:51" (1/2) ... [2025-04-25 12:44:51,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c44ae8 and model type context1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:44:51, skipping insertion in model container [2025-04-25 12:44:51,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "context1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:44:51" (2/2) ... [2025-04-25 12:44:51,563 INFO L128 eAbstractionObserver]: Analyzing ICFG context1.wvr.bpl [2025-04-25 12:44:51,573 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 12:44:51,575 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG context1.wvr.bpl that has 3 procedures, 14 locations, 13 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-25 12:44:51,575 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 12:44:51,607 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 12:44:51,643 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:44:51,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 12:44:51,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:44:51,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 12:44:51,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 12:44:51,684 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 12:44:51,698 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 12:44:51,704 INFO L340 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;@45196413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:44:51,704 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 12:44:51,747 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:51,747 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:51,747 INFO L139 ounterexampleChecker]: Examining path program with hash 1584562094, occurence #1 [2025-04-25 12:44:51,748 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:51,748 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:51,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash -546415899, now seen corresponding path program 1 times [2025-04-25 12:44:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:51,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795022954] [2025-04-25 12:44:51,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:51,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-25 12:44:51,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-25 12:44:51,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:51,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:51,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795022954] [2025-04-25 12:44:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795022954] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:51,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:51,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 12:44:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255782787] [2025-04-25 12:44:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:51,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:44:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:51,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:44:51,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:44:51,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:51,866 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:51,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-04-25 12:44:51,866 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:51,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:51,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 12:44:51,891 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:51,891 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:51,891 INFO L139 ounterexampleChecker]: Examining path program with hash 1584562094, occurence #2 [2025-04-25 12:44:51,891 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 12:44:51,892 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 12:44:51,892 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:51,892 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-25 12:44:51,892 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:51,892 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-25 12:44:51,892 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 12:44:51,892 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-25 12:44:51,892 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:51,893 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 12:44:51,893 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:51,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 241702208, now seen corresponding path program 1 times [2025-04-25 12:44:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:51,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885169164] [2025-04-25 12:44:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:51,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-25 12:44:51,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-25 12:44:51,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:51,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885169164] [2025-04-25 12:44:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885169164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:51,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:51,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 12:44:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515788553] [2025-04-25 12:44:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:51,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:44:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:51,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:44:51,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:44:51,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:51,942 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:51,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-04-25 12:44:51,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:51,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:51,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:51,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:51,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 12:44:51,963 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:51,963 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:51,963 INFO L139 ounterexampleChecker]: Examining path program with hash -1750589544, occurence #1 [2025-04-25 12:44:51,963 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:51,963 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:51,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash 422549127, now seen corresponding path program 1 times [2025-04-25 12:44:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:51,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000478565] [2025-04-25 12:44:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:51,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-25 12:44:51,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-25 12:44:51,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:51,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:52,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000478565] [2025-04-25 12:44:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000478565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 12:44:52,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071008612] [2025-04-25 12:44:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:44:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:44:52,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 12:44:52,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 12:44:52,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-25 12:44:52,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-25 12:44:52,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:52,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:52,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 12:44:52,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 12:44:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:52,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 12:44:52,220 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-25 12:44:52,221 INFO L354 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 14 treesize of output 11 [2025-04-25 12:44:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:44:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071008612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 12:44:52,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 12:44:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-25 12:44:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278988139] [2025-04-25 12:44:52,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 12:44:52,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 12:44:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:52,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 12:44:52,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-25 12:44:52,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:52,230 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:52,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-04-25 12:44:52,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,230 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:52,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:52,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-25 12:44:52,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-25 12:44:52,490 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:52,491 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:52,491 INFO L139 ounterexampleChecker]: Examining path program with hash -1750589544, occurence #2 [2025-04-25 12:44:52,491 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 12:44:52,491 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 12:44:52,491 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:52,491 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-25 12:44:52,491 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:52,491 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-25 12:44:52,491 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 12:44:52,491 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-25 12:44:52,491 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:52,491 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 12:44:52,491 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:52,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 214846942, now seen corresponding path program 2 times [2025-04-25 12:44:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:52,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089045746] [2025-04-25 12:44:52,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 12:44:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:52,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-25 12:44:52,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-25 12:44:52,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 12:44:52,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 12:44:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:52,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089045746] [2025-04-25 12:44:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089045746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 12:44:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155640478] [2025-04-25 12:44:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:52,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 12:44:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:52,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 12:44:52,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 12:44:52,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:52,543 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:52,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04-25 12:44:52,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:52,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:52,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:52,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:44:52,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 12:44:52,572 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:52,572 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:52,572 INFO L139 ounterexampleChecker]: Examining path program with hash -1750589544, occurence #3 [2025-04-25 12:44:52,572 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 12:44:52,572 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 12:44:52,572 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:52,572 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-25 12:44:52,572 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 12:44:52,572 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-25 12:44:52,572 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:52,572 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 12:44:52,572 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:52,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash -409964119, now seen corresponding path program 3 times [2025-04-25 12:44:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:52,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745667117] [2025-04-25 12:44:52,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 12:44:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:52,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 3 equivalence classes. [2025-04-25 12:44:52,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 13 of 13 statements. [2025-04-25 12:44:52,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 12:44:52,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 12:44:52,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:52,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745667117] [2025-04-25 12:44:52,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745667117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 12:44:52,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716612691] [2025-04-25 12:44:52,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 12:44:52,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:44:52,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:44:52,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 12:44:52,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 12:44:52,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 3 equivalence classes. [2025-04-25 12:44:52,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 13 of 13 statements. [2025-04-25 12:44:52,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 12:44:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:52,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-25 12:44:52,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 12:44:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 12:44:52,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 12:44:52,713 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-25 12:44:52,713 INFO L354 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 14 treesize of output 11 [2025-04-25 12:44:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 12:44:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716612691] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 12:44:52,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 12:44:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-25 12:44:52,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126126409] [2025-04-25 12:44:52,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 12:44:52,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 12:44:52,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:52,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 12:44:52,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-25 12:44:52,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:52,722 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:52,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-04-25 12:44:52,722 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,722 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,722 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:52,722 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:44:52,722 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:52,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:52,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:52,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:44:52,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 12:44:52,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-25 12:44:52,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:44:52,981 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:52,981 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:52,981 INFO L139 ounterexampleChecker]: Examining path program with hash 169045709, occurence #1 [2025-04-25 12:44:52,981 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:44:52,981 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:44:52,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1205372806, now seen corresponding path program 4 times [2025-04-25 12:44:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:44:52,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327110150] [2025-04-25 12:44:52,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 12:44:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:52,985 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-25 12:44:52,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 12:44:52,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 12:44:52,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 12:44:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:44:53,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327110150] [2025-04-25 12:44:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327110150] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 12:44:53,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317195917] [2025-04-25 12:44:53,125 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 12:44:53,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:44:53,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:44:53,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 12:44:53,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 12:44:53,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-25 12:44:53,159 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 12:44:53,159 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 12:44:53,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:53,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-25 12:44:53,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 12:44:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 12:44:53,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 12:44:53,206 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-25 12:44:53,207 INFO L354 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 16 treesize of output 11 [2025-04-25 12:44:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 12:44:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317195917] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 12:44:53,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 12:44:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2025-04-25 12:44:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792543410] [2025-04-25 12:44:53,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 12:44:53,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-25 12:44:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:44:53,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-25 12:44:53,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-25 12:44:53,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:53,220 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:53,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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-04-25 12:44:53,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:53,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:44:53,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 12:44:53,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:53,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:53,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:44:53,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 12:44:53,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 12:44:53,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 12:44:53,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:44:53,501 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 12:44:53,501 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:44:53,501 INFO L139 ounterexampleChecker]: Examining path program with hash 169045709, occurence #2 [2025-04-25 12:44:53,501 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 12:44:53,501 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 12:44:53,501 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:44:53,501 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-25 12:44:53,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:44:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash 984235330, now seen corresponding path program 1 times [2025-04-25 12:44:53,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-25 12:44:53,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435835918] [2025-04-25 12:44:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:44:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:44:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-25 12:44:53,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-25 12:44:53,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:44:53,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:44:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 12:44:53,554 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-25 12:44:53,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435835918] [2025-04-25 12:44:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435835918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:44:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:44:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 12:44:53,555 INFO L172 ounterexampleChecker]: Successfully proved commutativity at non-minimality point 9. Constructing proof automaton... [2025-04-25 12:44:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:44:53,556 INFO L311 artialOrderCegarLoop]: Commutativity proof succeeded, skipping feasibility check. [2025-04-25 12:44:53,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 12:44:53,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SMTINTERPOL [2025-04-25 12:44:53,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 12:44:53,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-25 12:44:53,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:53,557 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:44:53,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04-25 12:44:53,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:53,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:44:53,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 12:44:53,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 12:44:53,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:44:53,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:44:53,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:53,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:44:53,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 12:44:53,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 12:44:53,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:44:53,591 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2025-04-25 12:44:53,591 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-25 12:44:53,591 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-25 12:44:53,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-25 12:44:53,594 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2025-04-25 12:44:53,596 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 12:44:53,596 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 12:44:53,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 12:44:53,604 INFO L201 PluginConnector]: Adding new model context1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:44:53 BasicIcfg [2025-04-25 12:44:53,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 12:44:53,605 INFO L158 Benchmark]: Toolchain (without parser) took 2274.76ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 96.3MB in the beginning and 108.9MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:53,605 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:53,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.66ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 94.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:53,605 INFO L158 Benchmark]: Boogie Preprocessor took 21.06ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 93.6MB in the end (delta: 901.8kB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:53,606 INFO L158 Benchmark]: RCFGBuilder took 173.19ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 84.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 12:44:53,606 INFO L158 Benchmark]: TraceAbstraction took 2046.43ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.7MB in the beginning and 108.9MB in the end (delta: -25.1MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:44:53,608 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.15ms. Allocated memory is still 167.8MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.66ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 94.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 21.06ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 93.6MB in the end (delta: 901.8kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 173.19ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 84.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 2046.43ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.7MB in the beginning and 108.9MB in the end (delta: -25.1MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 381, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 131, dependent conditional: 130, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 288, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 38, dependent conditional: 37, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 288, independent: 250, independent conditional: 12, independent unconditional: 238, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 288, independent: 250, independent conditional: 12, independent unconditional: 238, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 17, independent conditional: 9, independent unconditional: 9, dependent: 21, dependent conditional: 14, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 288, independent: 188, independent conditional: 8, independent unconditional: 180, dependent: 33, dependent conditional: 8, dependent unconditional: 25, unknown: 67, unknown conditional: 8, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 63, Positive conditional cache size: 5, Positive unconditional cache size: 58, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 206, Maximal queried relation: 3, Independence queries for same thread: 121, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 16, Number of trivial persistent sets: 13, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 381, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 131, dependent conditional: 130, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 288, independent: 250, independent conditional: 193, independent unconditional: 57, dependent: 38, dependent conditional: 37, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 288, independent: 250, independent conditional: 12, independent unconditional: 238, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 288, independent: 250, independent conditional: 12, independent unconditional: 238, dependent: 38, dependent conditional: 12, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 17, independent conditional: 9, independent unconditional: 9, dependent: 21, dependent conditional: 14, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 288, independent: 188, independent conditional: 8, independent unconditional: 180, dependent: 33, dependent conditional: 8, dependent unconditional: 25, unknown: 67, unknown conditional: 8, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 63, Positive conditional cache size: 5, Positive unconditional cache size: 58, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 206, Maximal queried relation: 3, Independence queries for same thread: 121 - PositiveResult [Line: 47]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 20 locations, 23 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 10 NumberOfNonLiveVariables, 147 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 24/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 1, ConComChecker Statistics: CheckTime [ms]: 54, ConditionCalculationTime [ms]: 8, ConditionCalculations: 10, QuantifiedConditions: 0, TraceChecks: 1, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-25 12:44:53,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...