/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/fibonacci.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 09:04:09,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 09:04:09,329 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 09:04:09,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 09:04:09,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 09:04:09,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 09:04:09,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 09:04:09,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 09:04:09,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 09:04:09,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 09:04:09,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 09:04:09,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 09:04:09,357 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 09:04:09,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 09:04:09,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 09:04:09,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 09:04:09,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 09:04:09,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 09:04:09,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 09:04:09,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 09:04:09,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 09:04:09,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 09:04:09,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 09:04:09,360 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 09:04:09,361 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 09:04:09,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT 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 09:04:09,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 09:04:09,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 09:04:09,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 09:04:09,580 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 09:04:09,581 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 09:04:09,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/fibonacci.wvr.bpl [2025-04-25 09:04:09,584 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/fibonacci.wvr.bpl' [2025-04-25 09:04:09,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 09:04:09,600 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 09:04:09,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 09:04:09,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 09:04:09,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 09:04:09,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,629 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 09:04:09,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 09:04:09,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 09:04:09,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 09:04:09,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 09:04:09,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 09:04:09,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 09:04:09,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 09:04:09,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 09:04:09,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/1) ... [2025-04-25 09:04:09,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 09:04:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 09:04:09,680 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 09:04:09,682 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 09:04:09,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 09:04:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 09:04:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 09:04:09,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 09:04:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 09:04:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 09:04:09,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 09:04:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 09:04:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 09:04:09,701 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 09:04:09,740 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 09:04:09,742 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 09:04:09,830 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 09:04:09,830 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 09:04:09,860 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 09:04:09,860 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-25 09:04:09,860 INFO L201 PluginConnector]: Adding new model fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 09:04:09 BoogieIcfgContainer [2025-04-25 09:04:09,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 09:04:09,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 09:04:09,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 09:04:09,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 09:04:09,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 09:04:09" (1/2) ... [2025-04-25 09:04:09,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb47e7d and model type fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 09:04:09, skipping insertion in model container [2025-04-25 09:04:09,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 09:04:09" (2/2) ... [2025-04-25 09:04:09,869 INFO L128 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.bpl [2025-04-25 09:04:09,880 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 09:04:09,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibonacci.wvr.bpl that has 3 procedures, 18 locations, 17 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-25 09:04:09,882 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 09:04:09,917 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 09:04:09,954 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 09:04:09,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 09:04:09,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 09:04:09,960 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 09:04:09,961 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 09:04:10,005 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 09:04:10,018 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 09:04:10,024 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;@173d2650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 09:04:10,025 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 09:04:10,059 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 09:04:10,059 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 09:04:10,059 INFO L139 ounterexampleChecker]: Examining path program with hash -1949251161, occurence #1 [2025-04-25 09:04:10,059 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 09:04:10,059 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 09:04:10,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 09:04:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1500871326, now seen corresponding path program 1 times [2025-04-25 09:04:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 09:04:10,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183155882] [2025-04-25 09:04:10,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 09:04:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 09:04:10,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-25 09:04:10,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-25 09:04:10,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 09:04:10,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:10,524 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 09:04:10,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 09:04:10,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183155882] [2025-04-25 09:04:10,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183155882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 09:04:10,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 09:04:10,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 09:04:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377322047] [2025-04-25 09:04:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 09:04:10,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 09:04:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 09:04:10,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 09:04:10,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-25 09:04:10,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:10,575 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 09:04:10,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 09:04:10,578 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:10,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:10,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 09:04:10,686 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 09:04:10,686 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 09:04:10,687 INFO L139 ounterexampleChecker]: Examining path program with hash -1949251161, occurence #2 [2025-04-25 09:04:10,687 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 09:04:10,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 09:04:10,688 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:10,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-25 09:04:10,688 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:10,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-25 09:04:10,688 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:10,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-25 09:04:10,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 09:04:10,688 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 09:04:10,688 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 09:04:10,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 09:04:10,688 INFO L85 PathProgramCache]: Analyzing trace with hash 687915263, now seen corresponding path program 1 times [2025-04-25 09:04:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 09:04:10,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045464518] [2025-04-25 09:04:10,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 09:04:10,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 09:04:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 09:04:10,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 09:04:10,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 09:04:10,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:10,752 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 09:04:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 09:04:10,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045464518] [2025-04-25 09:04:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045464518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 09:04:10,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 09:04:10,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 09:04:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503744350] [2025-04-25 09:04:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 09:04:10,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 09:04:10,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 09:04:10,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 09:04:10,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-25 09:04:10,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:10,754 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 09:04:10,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 09:04:10,754 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:10,754 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:10,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:10,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:10,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 09:04:10,835 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 09:04:10,835 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 09:04:10,835 INFO L139 ounterexampleChecker]: Examining path program with hash -1636762459, occurence #1 [2025-04-25 09:04:10,835 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 09:04:10,835 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 09:04:10,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 09:04:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1033687141, now seen corresponding path program 1 times [2025-04-25 09:04:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 09:04:10,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247213288] [2025-04-25 09:04:10,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 09:04:10,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 09:04:10,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-25 09:04:10,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-25 09:04:10,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 09:04:10,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:11,046 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 09:04:11,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 09:04:11,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247213288] [2025-04-25 09:04:11,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247213288] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 09:04:11,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991244964] [2025-04-25 09:04:11,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 09:04:11,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 09:04:11,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 09:04:11,049 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 09:04:11,051 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 09:04:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-25 09:04:11,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-25 09:04:11,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 09:04:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:11,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-25 09:04:11,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 09:04:11,264 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 09:04:11,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 09:04:11,442 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 09:04:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991244964] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 09:04:11,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 09:04:11,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-25 09:04:11,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466006495] [2025-04-25 09:04:11,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 09:04:11,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-25 09:04:11,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 09:04:11,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-25 09:04:11,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-25 09:04:11,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:11,444 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 09:04:11,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 09:04:11,444 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:11,444 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:11,444 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:11,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:11,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:11,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:11,575 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 09:04:11,773 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 09:04:11,773 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 09:04:11,773 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 09:04:11,773 INFO L139 ounterexampleChecker]: Examining path program with hash -1636762459, occurence #2 [2025-04-25 09:04:11,773 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 09:04:11,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 09:04:11,774 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:11,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-25 09:04:11,774 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:11,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-25 09:04:11,774 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:11,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-25 09:04:11,774 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 09:04:11,774 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 09:04:11,774 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 09:04:11,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 09:04:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1949816412, now seen corresponding path program 2 times [2025-04-25 09:04:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 09:04:11,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630779933] [2025-04-25 09:04:11,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 09:04:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 09:04:11,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-25 09:04:11,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 09:04:11,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 09:04:11,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 09:04:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 09:04:11,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630779933] [2025-04-25 09:04:11,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630779933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 09:04:11,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 09:04:11,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-25 09:04:11,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661258466] [2025-04-25 09:04:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 09:04:11,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 09:04:11,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 09:04:11,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 09:04:11,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-25 09:04:11,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:11,827 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 09:04:11,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 09:04:11,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:11,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:11,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:11,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:11,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:11,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:11,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:11,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:11,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 09:04:11,898 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 09:04:11,898 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 09:04:11,899 INFO L139 ounterexampleChecker]: Examining path program with hash -1636762459, occurence #3 [2025-04-25 09:04:11,899 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 09:04:11,899 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 09:04:11,899 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:11,899 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-25 09:04:11,899 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:11,899 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-25 09:04:11,899 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 09:04:11,899 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-25 09:04:11,899 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 09:04:11,899 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 09:04:11,899 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 09:04:11,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 09:04:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1497917096, now seen corresponding path program 3 times [2025-04-25 09:04:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 09:04:11,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719033072] [2025-04-25 09:04:11,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 09:04:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 09:04:11,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-04-25 09:04:11,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-25 09:04:11,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 09:04:11,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 09:04:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 09:04:12,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719033072] [2025-04-25 09:04:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719033072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 09:04:12,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162173623] [2025-04-25 09:04:12,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 09:04:12,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 09:04:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 09:04:12,078 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 09:04:12,079 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 09:04:12,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-04-25 09:04:12,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-25 09:04:12,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-25 09:04:12,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:12,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-25 09:04:12,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 09:04:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 09:04:12,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 09:04:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 09:04:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162173623] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 09:04:12,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 09:04:12,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2025-04-25 09:04:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261495493] [2025-04-25 09:04:12,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 09:04:12,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-25 09:04:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 09:04:12,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-25 09:04:12,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-25 09:04:12,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:12,395 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 09:04:12,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 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 09:04:12,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:12,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:12,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:12,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:12,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 09:04:12,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:12,535 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 09:04:12,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 09:04:12,732 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 09:04:12,732 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 09:04:12,732 INFO L139 ounterexampleChecker]: Examining path program with hash -2130866059, occurence #1 [2025-04-25 09:04:12,732 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 09:04:12,732 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 09:04:12,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 09:04:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 816136337, now seen corresponding path program 4 times [2025-04-25 09:04:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 09:04:12,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427107057] [2025-04-25 09:04:12,733 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 09:04:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 09:04:12,736 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-25 09:04:12,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 09:04:12,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 09:04:12,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 09:04:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 09:04:12,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427107057] [2025-04-25 09:04:12,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427107057] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 09:04:12,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268258583] [2025-04-25 09:04:12,765 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 09:04:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 09:04:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 09:04:12,767 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 09:04:12,768 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 09:04:12,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-25 09:04:12,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 09:04:12,792 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 09:04:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 09:04:12,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 09:04:12,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 09:04:12,836 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 09:04:12,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 09:04:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 09:04:12,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268258583] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 09:04:12,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 09:04:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-04-25 09:04:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354100208] [2025-04-25 09:04:12,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 09:04:12,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-25 09:04:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 09:04:12,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-25 09:04:12,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-25 09:04:12,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:12,858 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 09:04:12,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 09:04:12,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:12,859 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 09:04:12,859 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,859 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,859 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:12,859 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 09:04:12,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 09:04:12,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 09:04:12,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 09:04:12,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 09:04:12,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 09:04:12,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2025-04-25 09:04:12,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-25 09:04:12,960 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-25 09:04:12,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 09:04:13,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 09:04:13,165 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2025-04-25 09:04:13,167 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 09:04:13,167 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 09:04:13,174 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 09:04:13,175 INFO L201 PluginConnector]: Adding new model fibonacci.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 09:04:13 BasicIcfg [2025-04-25 09:04:13,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 09:04:13,176 INFO L158 Benchmark]: Toolchain (without parser) took 3575.09ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 99.6MB in the beginning and 84.7MB in the end (delta: 14.9MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 09:04:13,176 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 167.8MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 09:04:13,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.95ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 97.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 09:04:13,177 INFO L158 Benchmark]: Boogie Preprocessor took 24.99ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 96.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 09:04:13,177 INFO L158 Benchmark]: RCFGBuilder took 204.71ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 86.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 09:04:13,177 INFO L158 Benchmark]: TraceAbstraction took 3312.73ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 09:04:13,178 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.28ms. Allocated memory is still 167.8MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.95ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 97.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 24.99ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 96.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 204.71ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 86.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 3312.73ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 410, independent: 297, independent conditional: 188, independent unconditional: 109, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 297, independent conditional: 188, independent unconditional: 109, 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: 297, independent: 297, independent conditional: 188, independent unconditional: 109, 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: 297, independent: 297, independent conditional: 188, independent unconditional: 109, 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: 297, independent: 297, independent conditional: 0, independent unconditional: 297, 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: 297, independent: 297, independent conditional: 0, independent unconditional: 297, 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: 111, independent: 111, independent conditional: 0, independent unconditional: 111, 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: 111, independent: 110, independent conditional: 0, independent unconditional: 110, 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: 297, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 111, unknown conditional: 0, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, 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: 188, Maximal queried relation: 0, Independence queries for same thread: 113, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 24, Number of trivial persistent sets: 17, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 109, independent conditional: 0, independent unconditional: 109, 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: 410, independent: 297, independent conditional: 188, independent unconditional: 109, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, independent: 297, independent conditional: 188, independent unconditional: 109, 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: 297, independent: 297, independent conditional: 188, independent unconditional: 109, 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: 297, independent: 297, independent conditional: 188, independent unconditional: 109, 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: 297, independent: 297, independent conditional: 0, independent unconditional: 297, 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: 297, independent: 297, independent conditional: 0, independent unconditional: 297, 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: 111, independent: 111, independent conditional: 0, independent unconditional: 111, 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: 111, independent: 110, independent conditional: 0, independent unconditional: 110, 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: 297, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 111, unknown conditional: 0, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, 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: 188, Maximal queried relation: 0, Independence queries for same thread: 113 - PositiveResult [Line: 64]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 28 locations, 31 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.7s, 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: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1243 SizeOfPredicates, 11 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 6/24 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]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 3, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-25 09:04:13,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...