/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/loop-tiling-eq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 11:02:42,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 11:02:43,007 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 11:02:43,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 11:02:43,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 11:02:43,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 11:02:43,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 11:02:43,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 11:02:43,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 11:02:43,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 11:02:43,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 11:02:43,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 11:02:43,027 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 11:02:43,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 11:02:43,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 11:02:43,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 11:02:43,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 11:02:43,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 11:02:43,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 11:02:43,030 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 11:02:43,030 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 11:02:43,030 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 11:02:43,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 11:02:43,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 11:02:43,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 11:02:43,268 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 11:02:43,269 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 11:02:43,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl [2025-04-25 11:02:43,270 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/loop-tiling-eq.wvr.bpl' [2025-04-25 11:02:43,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 11:02:43,293 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 11:02:43,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 11:02:43,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 11:02:43,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 11:02:43,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,330 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 11:02:43,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 11:02:43,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 11:02:43,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 11:02:43,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 11:02:43,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 11:02:43,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 11:02:43,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 11:02:43,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 11:02:43,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/1) ... [2025-04-25 11:02:43,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 11:02:43,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:02:43,383 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 11:02:43,386 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 11:02:43,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 11:02:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 11:02:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 11:02:43,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 11:02:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 11:02:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 11:02:43,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 11:02:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 11:02:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 11:02:43,408 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 11:02:43,445 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 11:02:43,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 11:02:43,518 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 11:02:43,518 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 11:02:43,542 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 11:02:43,543 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-25 11:02:43,543 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 11:02:43 BoogieIcfgContainer [2025-04-25 11:02:43,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 11:02:43,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 11:02:43,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 11:02:43,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 11:02:43,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 11:02:43" (1/2) ... [2025-04-25 11:02:43,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee4ed4e and model type loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 11:02:43, skipping insertion in model container [2025-04-25 11:02:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 11:02:43" (2/2) ... [2025-04-25 11:02:43,553 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.bpl [2025-04-25 11:02:43,564 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 11:02:43,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.bpl that has 3 procedures, 18 locations, 18 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-25 11:02:43,566 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 11:02:43,601 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 11:02:43,641 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 11:02:43,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 11:02:43,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:02:43,644 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 11:02:43,645 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 11:02:43,690 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 11:02:43,705 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 11:02:43,710 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;@3a98cd3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 11:02:43,710 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 11:02:43,741 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 11:02:43,741 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:02:43,741 INFO L139 ounterexampleChecker]: Examining path program with hash 1534107289, occurence #1 [2025-04-25 11:02:43,741 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:02:43,741 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:02:43,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:02:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash -138855266, now seen corresponding path program 1 times [2025-04-25 11:02:43,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:02:43,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738949820] [2025-04-25 11:02:43,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:02:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:02:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-25 11:02:43,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-25 11:02:43,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:02:43,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:02:43,893 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 11:02:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:02:43,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738949820] [2025-04-25 11:02:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738949820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:02:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 11:02:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 11:02:43,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443630709] [2025-04-25 11:02:43,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:02:43,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 11:02:43,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:02:43,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 11:02:43,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 11:02:43,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:43,942 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:02:43,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 11:02:43,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:44,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 11:02:44,042 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 11:02:44,042 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:02:44,042 INFO L139 ounterexampleChecker]: Examining path program with hash 886743451, occurence #1 [2025-04-25 11:02:44,042 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:02:44,043 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:02:44,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:02:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash 611274844, now seen corresponding path program 1 times [2025-04-25 11:02:44,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:02:44,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850839927] [2025-04-25 11:02:44,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:02:44,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:02:44,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 11:02:44,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 11:02:44,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:02:44,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:02:44,093 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 11:02:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:02:44,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850839927] [2025-04-25 11:02:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850839927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 11:02:44,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 11:02:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 11:02:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903211963] [2025-04-25 11:02:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 11:02:44,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 11:02:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:02:44,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 11:02:44,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 11:02:44,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:44,095 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:02:44,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 11:02:44,095 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,095 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:44,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 11:02:44,150 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 11:02:44,150 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:02:44,150 INFO L139 ounterexampleChecker]: Examining path program with hash 886743451, occurence #2 [2025-04-25 11:02:44,150 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:02:44,151 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:02:44,152 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:02:44,152 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:02:44,152 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:02:44,152 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-25 11:02:44,152 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:44,152 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-25 11:02:44,152 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:44,152 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-25 11:02:44,152 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:02:44,152 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-25 11:02:44,152 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:44,152 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:02:44,152 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:02:44,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:02:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1553993677, now seen corresponding path program 1 times [2025-04-25 11:02:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:02:44,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765298581] [2025-04-25 11:02:44,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:02:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:02:44,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-25 11:02:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-25 11:02:44,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:02:44,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:02:44,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445371811] [2025-04-25 11:02:44,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:02:44,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:02:44,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:02:44,173 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 11:02:44,174 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 11:02:44,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-25 11:02:44,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-25 11:02:44,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:02:44,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:02:44,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 11:02:44,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:02:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:02:44,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:02:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:02:44,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:02:44,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765298581] [2025-04-25 11:02:44,637 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:02:44,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445371811] [2025-04-25 11:02:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445371811] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:02:44,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:02:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-04-25 11:02:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152294993] [2025-04-25 11:02:44,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:02:44,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-25 11:02:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:02:44,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-25 11:02:44,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-25 11:02:44,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:44,638 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:02:44,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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 11:02:44,638 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,638 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,638 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:44,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:44,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:02:44,804 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 11:02:44,997 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 11:02:44,998 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 11:02:44,998 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:02:44,998 INFO L139 ounterexampleChecker]: Examining path program with hash -190954116, occurence #1 [2025-04-25 11:02:44,998 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:02:44,998 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:02:44,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:02:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1413423709, now seen corresponding path program 1 times [2025-04-25 11:02:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:02:44,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540317121] [2025-04-25 11:02:44,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:02:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:02:45,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 11:02:45,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 11:02:45,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:02:45,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:02:45,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1607279154] [2025-04-25 11:02:45,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 11:02:45,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:02:45,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:02:45,014 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 11:02:45,016 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 11:02:45,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 11:02:45,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 11:02:45,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:02:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:02:45,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-25 11:02:45,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:02:45,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-25 11:02:45,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-25 11:02:45,126 INFO L354 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 17 treesize of output 13 [2025-04-25 11:02:45,191 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 11:02:45,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:02:45,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 46 treesize of output 42 [2025-04-25 11:02:46,150 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-25 11:02:46,150 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 18 treesize of output 18 [2025-04-25 11:02:46,178 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 11:02:46,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:02:46,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540317121] [2025-04-25 11:02:46,178 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:02:46,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607279154] [2025-04-25 11:02:46,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607279154] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:02:46,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:02:46,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-04-25 11:02:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046512230] [2025-04-25 11:02:46,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:02:46,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-25 11:02:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:02:46,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-25 11:02:46,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-25 11:02:46,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:46,179 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:02:46,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 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 11:02:46,180 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:46,180 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:46,180 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:02:46,180 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:02:50,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:02:54,702 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:02:58,707 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:02:58,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:58,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:02:58,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:02:58,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:02:58,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 11:02:59,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:02:59,044 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 11:02:59,044 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:02:59,044 INFO L139 ounterexampleChecker]: Examining path program with hash -190954116, occurence #2 [2025-04-25 11:02:59,045 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:02:59,045 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:02:59,045 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-25 11:02:59,045 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-25 11:02:59,045 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-25 11:02:59,045 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-25 11:02:59,045 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-25 11:02:59,045 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:02:59,045 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-25 11:02:59,045 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:02:59,045 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:02:59,045 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:02:59,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:02:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash -416615154, now seen corresponding path program 2 times [2025-04-25 11:02:59,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:02:59,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146675714] [2025-04-25 11:02:59,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:02:59,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:02:59,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-25 11:02:59,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-25 11:02:59,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:02:59,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:02:59,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11733940] [2025-04-25 11:02:59,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:02:59,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:02:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:02:59,067 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 11:02:59,067 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 11:02:59,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-25 11:02:59,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-25 11:02:59,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:02:59,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:02:59,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-25 11:02:59,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:02:59,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-25 11:02:59,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-25 11:02:59,187 INFO L354 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 17 treesize of output 13 [2025-04-25 11:02:59,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:02:59,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 11:02:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:02:59,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:03:00,020 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:03:00,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-04-25 11:03:00,038 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:03:00,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2025-04-25 11:03:00,045 INFO L354 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 15 treesize of output 13 [2025-04-25 11:03:00,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:03:00,550 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 57 treesize of output 62 [2025-04-25 11:03:00,554 INFO L354 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 68 treesize of output 62 [2025-04-25 11:03:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:03:00,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:03:00,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146675714] [2025-04-25 11:03:00,795 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:03:00,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11733940] [2025-04-25 11:03:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11733940] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:03:00,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:03:00,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-04-25 11:03:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317238378] [2025-04-25 11:03:00,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:03:00,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-25 11:03:00,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:03:00,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-25 11:03:00,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=377, Unknown=3, NotChecked=0, Total=462 [2025-04-25 11:03:00,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:03:00,797 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:03:00,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 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 11:03:00,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:03:00,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:03:00,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:03:00,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:03:00,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:03:09,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:14,719 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:19,233 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:23,586 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:27,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:29,316 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:34,444 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:38,551 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:42,563 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:46,572 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:50,620 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:54,626 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:56,151 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:03:59,552 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:03,594 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:07,597 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:11,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:13,902 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:18,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:22,707 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:26,804 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:28,415 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:31,587 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:35,648 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:39,661 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:43,680 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:47,719 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:49,243 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:53,279 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:57,283 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:04:57,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:04:57,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:04:57,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:04:57,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:04:57,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:04:57,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-25 11:04:57,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:04:57,508 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 11:04:57,509 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:04:57,509 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #1 [2025-04-25 11:04:57,509 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:04:57,509 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:04:57,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:04:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2051357228, now seen corresponding path program 3 times [2025-04-25 11:04:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:04:57,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24783634] [2025-04-25 11:04:57,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:04:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:04:57,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-25 11:04:57,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 11:04:57,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 11:04:57,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:04:57,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156866781] [2025-04-25 11:04:57,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:04:57,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:04:57,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:04:57,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:04:57,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-25 11:04:57,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-25 11:04:57,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 11:04:57,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 11:04:57,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:04:57,557 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-25 11:04:57,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:04:57,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-25 11:04:57,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2025-04-25 11:04:57,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-25 11:04:57,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:04:57,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2025-04-25 11:04:57,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-04-25 11:04:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:04:57,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:04:58,240 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:04:58,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 51 [2025-04-25 11:04:58,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:04:58,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:04:58,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2025-04-25 11:04:58,266 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:04:58,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-04-25 11:04:58,272 INFO L354 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 12 treesize of output 10 [2025-04-25 11:04:58,284 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:04:58,284 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 35 treesize of output 39 [2025-04-25 11:05:39,074 INFO L325 Elim1Store]: treesize reduction 10, result has 56.5 percent of original size [2025-04-25 11:05:39,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 30 [2025-04-25 11:05:39,117 INFO L325 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2025-04-25 11:05:39,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2025-04-25 11:05:39,133 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:05:39,140 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:05:39,147 INFO L325 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2025-04-25 11:05:39,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2025-04-25 11:05:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:05:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:05:39,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24783634] [2025-04-25 11:05:39,187 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:05:39,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156866781] [2025-04-25 11:05:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156866781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:05:39,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:05:39,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-04-25 11:05:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797485407] [2025-04-25 11:05:39,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:05:39,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-25 11:05:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:05:39,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-25 11:05:39,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=414, Unknown=10, NotChecked=0, Total=506 [2025-04-25 11:05:39,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:05:39,188 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:05:39,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 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 11:05:39,188 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:05:39,188 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:05:39,188 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:05:39,188 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:05:39,188 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:05:39,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:05:40,894 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:05:59,862 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:16,058 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:20,067 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:23,571 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:27,577 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:31,593 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:36,407 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:39,371 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:43,378 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:47,393 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:49,000 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:06:55,860 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:07:52,605 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:07:56,632 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:08:01,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:08:06,600 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select c_F 0))) (and (= .cse0 (select (select c_B 0) 0)) (= .cse0 (select c_A 0)) (or (< 1 c_M) (forall ((b Int) (a Int)) (let ((.cse1 (+ c_i 1))) (or (= (select c_A (+ b (* a c_M))) (select (select (store c_B .cse1 (store (select c_B .cse1) 0 (select c_F (* .cse1 c_M)))) a) b)) (< .cse1 a) (< c_M (+ b 1)) (< a 0) (< b 0))))) (= c_i 1) (forall ((b Int) (a Int)) (or (< c_i (+ a 1)) (= (select c_A (+ b (* a c_M))) (select (select c_B a) b)) (< c_M (+ b 1)) (< a 0) (< b 0))) (= (select c_A 1) (select c_F 1)))) is different from false [2025-04-25 11:08:06,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:06,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:06,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:08:06,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:08:06,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:08:06,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-25 11:08:06,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-25 11:08:06,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-25 11:08:06,917 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 11:08:06,917 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:08:06,917 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #2 [2025-04-25 11:08:06,917 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:08:06,917 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:08:06,917 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:06,917 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:08:06,917 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:06,917 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-25 11:08:06,917 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:06,917 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-25 11:08:06,918 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:06,918 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-25 11:08:06,918 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:06,918 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-25 11:08:06,918 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:06,918 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-25 11:08:06,918 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:06,918 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-25 11:08:06,918 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:06,918 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-25 11:08:06,918 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:06,918 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:08:06,918 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:08:06,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:08:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2076745755, now seen corresponding path program 4 times [2025-04-25 11:08:06,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:08:06,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526152543] [2025-04-25 11:08:06,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 11:08:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:08:06,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-25 11:08:06,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 11:08:06,941 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 11:08:06,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:08:06,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [863651998] [2025-04-25 11:08:06,942 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 11:08:06,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:08:06,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:08:06,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:08:06,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-25 11:08:06,964 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-25 11:08:06,973 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 11:08:06,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 11:08:06,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:08:06,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-25 11:08:06,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:08:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 11:08:07,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:08:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 11:08:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:08:07,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526152543] [2025-04-25 11:08:07,445 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:08:07,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863651998] [2025-04-25 11:08:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863651998] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:08:07,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:08:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-04-25 11:08:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674167039] [2025-04-25 11:08:07,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:08:07,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-25 11:08:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:08:07,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-25 11:08:07,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-25 11:08:07,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:08:07,446 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:08:07,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 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 11:08:07,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:07,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:07,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:08:07,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:08:07,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:08:07,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2025-04-25 11:08:07,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:08:12,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:12,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:12,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:08:12,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:08:12,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:08:12,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-25 11:08:12,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:08:12,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-25 11:08:13,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:08:13,098 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 11:08:13,098 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:08:13,099 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #3 [2025-04-25 11:08:13,099 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:08:13,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:08:13,099 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:13,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:08:13,099 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:13,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-25 11:08:13,099 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-25 11:08:13,099 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-25 11:08:13,099 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-25 11:08:13,099 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:13,099 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-25 11:08:13,099 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,099 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:08:13,099 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:08:13,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:08:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash 138887267, now seen corresponding path program 5 times [2025-04-25 11:08:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:08:13,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366836798] [2025-04-25 11:08:13,100 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 11:08:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:08:13,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-25 11:08:13,114 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 11:08:13,114 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-25 11:08:13,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:08:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:08:13,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:08:13,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366836798] [2025-04-25 11:08:13,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366836798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 11:08:13,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753604823] [2025-04-25 11:08:13,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 11:08:13,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:08:13,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:08:13,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:08:13,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-25 11:08:13,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-25 11:08:13,220 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 11:08:13,220 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-25 11:08:13,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:08:13,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 11:08:13,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:08:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:08:13,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:08:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:08:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753604823] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:08:13,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 11:08:13,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-04-25 11:08:13,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772448525] [2025-04-25 11:08:13,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 11:08:13,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-25 11:08:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:08:13,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-25 11:08:13,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-25 11:08:13,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:08:13,268 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:08:13,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2025-04-25 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:08:13,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:08:13,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:13,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:13,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:08:13,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:08:13,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:08:13,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-25 11:08:13,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:08:13,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:08:13,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-25 11:08:13,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-25 11:08:13,597 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 11:08:13,597 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:08:13,598 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #4 [2025-04-25 11:08:13,598 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:08:13,598 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:08:13,598 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-25 11:08:13,598 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-25 11:08:13,598 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-25 11:08:13,598 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-25 11:08:13,598 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-25 11:08:13,598 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:08:13,598 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-25 11:08:13,598 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:08:13,598 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:08:13,598 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:08:13,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:08:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -80721656, now seen corresponding path program 6 times [2025-04-25 11:08:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:08:13,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919227350] [2025-04-25 11:08:13,599 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 11:08:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:08:13,603 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-25 11:08:13,613 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 11:08:13,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-25 11:08:13,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:08:13,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452610873] [2025-04-25 11:08:13,614 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 11:08:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:08:13,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:08:13,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:08:13,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-25 11:08:13,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-25 11:08:13,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 11:08:13,651 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-25 11:08:13,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:08:13,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-25 11:08:13,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:08:13,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-25 11:08:13,688 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2025-04-25 11:08:13,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-25 11:08:13,769 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-25 11:08:13,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2025-04-25 11:08:13,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-04-25 11:08:13,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-04-25 11:08:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:08:13,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:08:15,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:08:15,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 50 [2025-04-25 11:08:15,589 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:08:15,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 79 [2025-04-25 11:08:15,599 INFO L354 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 17 treesize of output 15 [2025-04-25 11:08:17,171 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-25 11:08:17,172 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 18 treesize of output 18 [2025-04-25 11:08:17,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:08:17,182 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:08:17,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:08:17,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-04-25 11:08:17,192 INFO L354 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 47 treesize of output 41 [2025-04-25 11:08:17,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:08:17,204 INFO L354 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 29 treesize of output 17 [2025-04-25 11:08:17,206 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:08:17,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:08:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:08:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:08:17,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919227350] [2025-04-25 11:08:17,295 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:08:17,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452610873] [2025-04-25 11:08:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452610873] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:08:17,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:08:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2025-04-25 11:08:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795824091] [2025-04-25 11:08:17,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:08:17,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-25 11:08:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:08:17,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-25 11:08:17,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=716, Unknown=3, NotChecked=0, Total=870 [2025-04-25 11:08:17,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:08:17,297 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:08:17,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 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 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:08:17,297 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:08:24,298 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:08:30,200 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:08:37,440 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:08:42,293 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:08:54,910 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:08:57,831 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:09:01,855 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:09:05,859 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:09:09,866 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:09:18,665 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:10:10,664 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:10:14,006 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:10:18,346 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:10:22,421 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:10:33,102 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:11:53,778 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:11:57,014 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:11:58,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-25 11:11:58,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-25 11:11:58,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:11:58,964 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 11:11:58,964 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:11:58,964 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #5 [2025-04-25 11:11:58,964 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:11:58,964 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:11:58,964 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-25 11:11:58,964 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-25 11:11:58,964 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-25 11:11:58,964 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-25 11:11:58,964 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-25 11:11:58,964 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:11:58,964 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-25 11:11:58,964 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:11:58,964 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:11:58,964 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:11:58,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:11:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2121826196, now seen corresponding path program 7 times [2025-04-25 11:11:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:11:58,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866778405] [2025-04-25 11:11:58,965 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-25 11:11:58,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:11:58,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 11:11:58,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 11:11:58,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:11:58,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:11:58,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787145111] [2025-04-25 11:11:58,986 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-25 11:11:58,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:11:58,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:11:58,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:11:58,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-25 11:11:59,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 11:11:59,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 11:11:59,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 11:11:59,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:11:59,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-25 11:11:59,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:11:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 11:11:59,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:12:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 11:12:02,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:12:02,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866778405] [2025-04-25 11:12:02,319 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:12:02,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787145111] [2025-04-25 11:12:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787145111] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:12:02,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:12:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-04-25 11:12:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552510516] [2025-04-25 11:12:02,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:12:02,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-25 11:12:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:12:02,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-25 11:12:02,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-04-25 11:12:02,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:12:02,320 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:12:02,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 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 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:12:02,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2025-04-25 11:12:02,321 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:12:05,303 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:12:09,333 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:12:13,416 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:12:17,429 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:12:21,436 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:12:25,536 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:12:47,046 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:12:47,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:12:47,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:12:47,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:12:47,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:12:47,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:12:47,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:12:47,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:12:47,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:12:47,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-25 11:12:47,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-25 11:12:47,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-25 11:12:47,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-25 11:12:47,520 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 11:12:47,520 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:12:47,520 INFO L139 ounterexampleChecker]: Examining path program with hash 1026289257, occurence #6 [2025-04-25 11:12:47,520 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:12:47,520 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:12:47,520 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:12:47,521 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:12:47,521 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:12:47,521 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-25 11:12:47,521 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:12:47,521 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-25 11:12:47,521 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:12:47,521 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-25 11:12:47,521 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:12:47,521 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-25 11:12:47,521 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:12:47,521 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:12:47,521 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:12:47,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:12:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1177366474, now seen corresponding path program 8 times [2025-04-25 11:12:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:12:47,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799082514] [2025-04-25 11:12:47,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:12:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:12:47,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-25 11:12:47,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 11:12:47,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:12:47,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:12:47,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741538569] [2025-04-25 11:12:47,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 11:12:47,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:12:47,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:12:47,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:12:47,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-25 11:12:47,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-25 11:12:47,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 11:12:47,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 11:12:47,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:12:47,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-25 11:12:47,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:12:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 11:12:47,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:12:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 11:12:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:12:48,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799082514] [2025-04-25 11:12:48,004 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:12:48,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741538569] [2025-04-25 11:12:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741538569] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:12:48,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:12:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-04-25 11:12:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739167765] [2025-04-25 11:12:48,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:12:48,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-25 11:12:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:12:48,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-25 11:12:48,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-04-25 11:12:48,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:12:48,005 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:12:48,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 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 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2025-04-25 11:12:48,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:13:04,579 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((M Int)) (or (< (+ 2 c_x) (+ M (* c_i M))) (< M 3))) (or (< c_L (* c_N c_M)) (< c_i c_N)) (or (forall ((M Int)) (or (< M (+ 3 c_j)) (< (+ c_x 1) (* c_N M)))) (< (+ c_i 1) c_N))) is different from false [2025-04-25 11:13:19,299 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (< (+ c_i 1) c_N)) (.cse1 (+ c_x 1))) (and (or (forall ((M Int)) (or (< c_x (* c_N M)) (< M (+ 2 c_j)))) .cse0) (or (< c_L (* c_N c_M)) (< c_i c_N)) (or (forall ((M Int)) (or (< M (+ 3 c_j)) (< .cse1 (* c_N M)))) .cse0) (forall ((M Int)) (or (< M 3) (< .cse1 (+ M (* c_i M))))))) is different from false [2025-04-25 11:13:35,330 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (< (+ c_i 1) c_N))) (and (forall ((M Int)) (or (< (+ 2 c_x) (+ M (* c_i M))) (< M 3))) (or (forall ((M Int)) (or (< c_L (* c_N M)) (< M (+ c_j 1)))) .cse0) (or (forall ((M Int)) (or (< c_x (* c_N M)) (< M (+ 2 c_j)))) .cse0) (< c_L (* c_N c_M)) (or (forall ((M Int)) (or (< M (+ 3 c_j)) (< (+ c_x 1) (* c_N M)))) .cse0))) is different from false [2025-04-25 11:13:53,363 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:13:58,236 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:13:59,690 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:14:02,212 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:14:06,360 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:14:10,451 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:14:22,489 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:14:22,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-25 11:14:22,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-25 11:14:22,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-25 11:14:22,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-25 11:14:22,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-25 11:14:22,731 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 11:14:22,731 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:14:22,732 INFO L139 ounterexampleChecker]: Examining path program with hash 1658234101, occurence #1 [2025-04-25 11:14:22,732 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 11:14:22,732 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:14:22,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:14:22,732 INFO L85 PathProgramCache]: Analyzing trace with hash 581976207, now seen corresponding path program 9 times [2025-04-25 11:14:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:14:22,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727111657] [2025-04-25 11:14:22,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:14:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:14:22,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-04-25 11:14:22,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 11:14:22,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-25 11:14:22,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:14:22,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314329737] [2025-04-25 11:14:22,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 11:14:22,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:14:22,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:14:22,744 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:14:22,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-25 11:14:22,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-04-25 11:14:22,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 11:14:22,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-25 11:14:22,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:14:22,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-25 11:14:22,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:14:22,807 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-25 11:14:22,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2025-04-25 11:14:22,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-25 11:14:22,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2025-04-25 11:14:23,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-25 11:14:23,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-04-25 11:14:23,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2025-04-25 11:14:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:14:23,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:14:23,905 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:14:23,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 68 [2025-04-25 11:14:23,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:14:23,916 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 67 [2025-04-25 11:14:23,930 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:14:23,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 80 [2025-04-25 11:14:23,936 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:14:23,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-04-25 11:14:23,943 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:14:23,944 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-04-25 11:14:23,951 INFO L354 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 10 treesize of output 8 [2025-04-25 11:14:23,957 INFO L354 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 10 treesize of output 8 [2025-04-25 11:14:23,968 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 11:14:23,968 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 50 treesize of output 52 [2025-04-25 11:14:24,727 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,727 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,733 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-25 11:14:24,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2025-04-25 11:14:24,739 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,740 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-04-25 11:14:24,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,750 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,751 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2025-04-25 11:14:24,753 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,759 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,760 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,760 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,762 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 37 [2025-04-25 11:14:24,767 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 178 [2025-04-25 11:14:24,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,786 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,786 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 11:14:24,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2025-04-25 11:14:24,793 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 11:14:24,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2025-04-25 11:14:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 11:14:24,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:14:24,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727111657] [2025-04-25 11:14:24,862 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:14:24,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314329737] [2025-04-25 11:14:24,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314329737] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:14:24,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:14:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2025-04-25 11:14:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871726767] [2025-04-25 11:14:24,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:14:24,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-25 11:14:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:14:24,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-25 11:14:24,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2025-04-25 11:14:24,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:14:24,863 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:14:24,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 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 11:14:24,863 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:14:24,863 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:14:24,863 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:14:24,863 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:14:24,863 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:14:24,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:14:24,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:14:24,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:14:24,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2025-04-25 11:14:24,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-04-25 11:14:24,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2025-04-25 11:14:24,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:14:31,206 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:14:42,468 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:15:19,499 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:15:23,576 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:15:27,667 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:15:32,144 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:15:37,099 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:15:41,774 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:16:05,026 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:16:19,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-25 11:16:19,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-25 11:16:19,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-25 11:16:19,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:16:19,890 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 11:16:19,890 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 11:16:19,890 INFO L139 ounterexampleChecker]: Examining path program with hash 1658234101, occurence #2 [2025-04-25 11:16:19,890 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 11:16:19,890 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 11:16:19,890 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-25 11:16:19,890 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-25 11:16:19,890 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-25 11:16:19,890 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-25 11:16:19,890 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-25 11:16:19,890 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-25 11:16:19,890 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-25 11:16:19,890 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 11:16:19,890 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-25 11:16:19,890 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 11:16:19,890 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 11:16:19,890 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 11:16:19,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 11:16:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2100061534, now seen corresponding path program 10 times [2025-04-25 11:16:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 11:16:19,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795947311] [2025-04-25 11:16:19,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 11:16:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 11:16:19,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-25 11:16:19,900 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 11:16:19,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 11:16:19,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-25 11:16:19,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857996980] [2025-04-25 11:16:19,901 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 11:16:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 11:16:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 11:16:19,903 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 11:16:19,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-25 11:16:19,933 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-25 11:16:19,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 11:16:19,944 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 11:16:19,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 11:16:19,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-25 11:16:19,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 11:16:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 11:16:20,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 11:16:20,805 WARN L849 $PredicateComparison]: unable to prove that (forall ((N Int)) (or (< N (+ 3 c_i)) (< c_x (* N c_M)))) is different from false [2025-04-25 11:16:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2025-04-25 11:16:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 11:16:25,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795947311] [2025-04-25 11:16:25,209 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-25 11:16:25,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857996980] [2025-04-25 11:16:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857996980] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 11:16:25,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 11:16:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-04-25 11:16:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203022385] [2025-04-25 11:16:25,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 11:16:25,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-25 11:16:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 11:16:25,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-25 11:16:25,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=473, Unknown=2, NotChecked=44, Total=600 [2025-04-25 11:16:25,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:16:25,210 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 11:16:25,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 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 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2025-04-25 11:16:25,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 11:16:29,886 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:17:17,464 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-04-25 11:17:21,480 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] Received shutdown request... [2025-04-25 11:17:24,299 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 11:17:24,300 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 11:17:24,300 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 11:17:25,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-25 11:17:25,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-25 11:17:25,500 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-25 11:17:25,701 FATAL L548 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Could not destroy process within 200 ms, abandoning it [2025-04-25 11:17:25,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-25 11:17:25,734 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-25 11:17:25,735 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2025-04-25 11:17:25,736 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-25 11:17:25,736 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-25 11:17:25,740 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2025-04-25 11:17:25,742 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 11:17:25,742 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 11:17:25,747 INFO L201 PluginConnector]: Adding new model loop-tiling-eq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 11:17:25 BasicIcfg [2025-04-25 11:17:25,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 11:17:25,748 INFO L158 Benchmark]: Toolchain (without parser) took 882454.45ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 100.6MB in the beginning and 77.5MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2025-04-25 11:17:25,748 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 11:17:25,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.75ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 98.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 11:17:25,748 INFO L158 Benchmark]: Boogie Preprocessor took 27.15ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 97.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 11:17:25,748 INFO L158 Benchmark]: RCFGBuilder took 183.50ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 87.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 11:17:25,748 INFO L158 Benchmark]: TraceAbstraction took 882200.06ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 86.3MB in the beginning and 77.5MB in the end (delta: 8.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2025-04-25 11:17:25,749 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.17ms. Allocated memory is still 167.8MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.75ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 98.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 27.15ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 97.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 183.50ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 87.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 882200.06ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 86.3MB in the beginning and 77.5MB in the end (delta: 8.8MB). Peak memory consumption was 16.8MB. 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: 3149, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 2033, dependent conditional: 2033, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 0, independent unconditional: 1116, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 0, independent unconditional: 1116, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1116, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 972, Maximal queried relation: 0, Independence queries for same thread: 2033, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 24, Number of trivial persistent sets: 14, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3149, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 2033, dependent conditional: 2033, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 972, independent unconditional: 144, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 0, independent unconditional: 1116, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1116, independent: 1116, independent conditional: 0, independent unconditional: 1116, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1116, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 972, Maximal queried relation: 0, Independence queries for same thread: 2033 - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 29 locations, 34 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 882.1s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 819.0s, 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: 456, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 60.3s InterpolantComputationTime, 488 NumberOfCodeBlocks, 488 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 484 ConstructedInterpolants, 135 QuantifiedInterpolants, 9451 SizeOfPredicates, 135 NumberOfNonLiveVariables, 819 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 25 InterpolantComputations, 2 PerfectInterpolantSequences, 62/239 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: 0, ConComChecker Statistics: CheckTime [ms]: 1, ConditionCalculationTime [ms]: 0, ConditionCalculations: 38, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown