/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy10.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 12:45:01,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 12:45:01,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 12:45:01,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 12:45:01,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 12:45:01,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 12:45:01,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 12:45:01,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 12:45:01,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 12:45:01,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 12:45:01,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 12:45:01,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 12:45:01,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 12:45:01,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:45:01,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:45:01,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:45:01,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 12:45:01,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 12:45:01,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 12:45:01,202 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 12:45:01,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 12:45:01,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 12:45:01,202 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 12:45:01,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 12:45:01,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 12:45:01,203 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 12:45:01,203 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 12:45:01,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-04-25 12:45:01,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 12:45:01,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 12:45:01,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 12:45:01,420 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 12:45:01,421 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 12:45:01,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy10.wvr.bpl [2025-04-25 12:45:01,422 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/easy10.wvr.bpl' [2025-04-25 12:45:01,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 12:45:01,442 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 12:45:01,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 12:45:01,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 12:45:01,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 12:45:01,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,476 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 12:45:01,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 12:45:01,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 12:45:01,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 12:45:01,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 12:45:01,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 12:45:01,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 12:45:01,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 12:45:01,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 12:45:01,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/1) ... [2025-04-25 12:45:01,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:45:01,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:45:01,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 12:45:01,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 12:45:01,545 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 12:45:01,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 12:45:01,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 12:45:01,545 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 12:45:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 12:45:01,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 12:45:01,546 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 12:45:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 12:45:01,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 12:45:01,546 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-25 12:45:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 12:45:01,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 12:45:01,546 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-25 12:45:01,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-25 12:45:01,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-25 12:45:01,547 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 12:45:01,583 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 12:45:01,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 12:45:01,664 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 12:45:01,665 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 12:45:01,672 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 12:45:01,672 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 12:45:01,672 INFO L201 PluginConnector]: Adding new model easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:45:01 BoogieIcfgContainer [2025-04-25 12:45:01,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 12:45:01,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 12:45:01,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 12:45:01,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 12:45:01,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:45:01" (1/2) ... [2025-04-25 12:45:01,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c2b367 and model type easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:45:01, skipping insertion in model container [2025-04-25 12:45:01,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:45:01" (2/2) ... [2025-04-25 12:45:01,678 INFO L128 eAbstractionObserver]: Analyzing ICFG easy10.wvr.bpl [2025-04-25 12:45:01,687 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 12:45:01,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG easy10.wvr.bpl that has 5 procedures, 46 locations, 41 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-25 12:45:01,689 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 12:45:01,720 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-25 12:45:01,752 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:45:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 12:45:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:45:01,754 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 12:45:01,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 12:45:01,794 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 12:45:01,809 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 12:45:01,814 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;@7953f81a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:45:01,815 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-25 12:45:01,905 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 12:45:01,906 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:45:01,906 INFO L139 ounterexampleChecker]: Examining path program with hash 1244930323, occurence #1 [2025-04-25 12:45:01,906 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:45:01,906 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:45:01,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:45:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash -775351420, now seen corresponding path program 1 times [2025-04-25 12:45:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:45:01,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146689337] [2025-04-25 12:45:01,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:45:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:45:01,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-25 12:45:01,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-25 12:45:01,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:45:01,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:45:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:45:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:45:02,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146689337] [2025-04-25 12:45:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146689337] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:45:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:45:02,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 12:45:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448381716] [2025-04-25 12:45:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:45:02,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:45:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:45:02,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:45:02,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:45:02,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:02,093 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:45:02,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:45:02,095 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:02,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:02,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 12:45:02,156 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 12:45:02,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:45:02,156 INFO L139 ounterexampleChecker]: Examining path program with hash -533377505, occurence #1 [2025-04-25 12:45:02,156 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:45:02,156 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:45:02,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:45:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1274406660, now seen corresponding path program 2 times [2025-04-25 12:45:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:45:02,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030621025] [2025-04-25 12:45:02,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 12:45:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:45:02,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-04-25 12:45:02,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-25 12:45:02,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 12:45:02,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:45:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:45:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:45:02,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030621025] [2025-04-25 12:45:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030621025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:45:02,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:45:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 12:45:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765873189] [2025-04-25 12:45:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:45:02,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:45:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:45:02,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:45:02,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:45:02,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:02,222 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:45:02,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:45:02,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:02,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:02,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:02,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:02,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 12:45:02,262 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 12:45:02,262 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:45:02,262 INFO L139 ounterexampleChecker]: Examining path program with hash 284773782, occurence #1 [2025-04-25 12:45:02,262 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:45:02,262 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:45:02,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:45:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1867163876, now seen corresponding path program 3 times [2025-04-25 12:45:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:45:02,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293134798] [2025-04-25 12:45:02,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 12:45:02,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:45:02,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-04-25 12:45:02,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-25 12:45:02,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-25 12:45:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:45:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:45:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:45:02,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293134798] [2025-04-25 12:45:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293134798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:45:02,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:45:02,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-25 12:45:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741482918] [2025-04-25 12:45:02,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:45:02,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-25 12:45:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:45:02,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-25 12:45:02,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-04-25 12:45:02,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:02,815 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:45:02,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:45:02,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:02,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:02,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:03,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 12:45:03,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 12:45:03,298 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 12:45:03,298 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:45:03,298 INFO L139 ounterexampleChecker]: Examining path program with hash -314016751, occurence #1 [2025-04-25 12:45:03,298 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:45:03,298 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:45:03,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:45:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2116900922, now seen corresponding path program 4 times [2025-04-25 12:45:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:45:03,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225023132] [2025-04-25 12:45:03,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 12:45:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:45:03,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-25 12:45:03,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-25 12:45:03,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 12:45:03,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:45:03,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:45:03,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:45:03,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225023132] [2025-04-25 12:45:03,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225023132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:45:03,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:45:03,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 12:45:03,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605332919] [2025-04-25 12:45:03,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:45:03,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:45:03,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:45:03,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:45:03,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:45:03,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:03,341 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:45:03,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:45:03,341 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,341 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,341 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 12:45:03,341 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:03,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-25 12:45:03,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 12:45:03,696 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-25 12:45:03,696 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:45:03,696 INFO L139 ounterexampleChecker]: Examining path program with hash 1080518511, occurence #1 [2025-04-25 12:45:03,696 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:45:03,696 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:45:03,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:45:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash 340365988, now seen corresponding path program 5 times [2025-04-25 12:45:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:45:03,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075797464] [2025-04-25 12:45:03,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 12:45:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:45:03,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-04-25 12:45:03,706 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-25 12:45:03,707 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 12:45:03,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:45:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:45:03,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:45:03,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075797464] [2025-04-25 12:45:03,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075797464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:45:03,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:45:03,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 12:45:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485601855] [2025-04-25 12:45:03,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:45:03,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:45:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:45:03,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:45:03,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:45:03,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:03,716 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:45:03,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:45:03,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2025-04-25 12:45:03,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:45:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-25 12:45:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:45:03,786 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2025-04-25 12:45:03,786 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-25 12:45:03,786 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-25 12:45:03,786 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-25 12:45:03,786 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-25 12:45:03,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 12:45:03,790 INFO L422 BasicCegarLoop]: Path program histogram: [5] [2025-04-25 12:45:03,792 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 12:45:03,792 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 12:45:03,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 12:45:03,800 INFO L201 PluginConnector]: Adding new model easy10.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:45:03 BasicIcfg [2025-04-25 12:45:03,800 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 12:45:03,800 INFO L158 Benchmark]: Toolchain (without parser) took 2358.04ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 96.7MB in the beginning and 85.7MB in the end (delta: 11.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:45:03,801 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:45:03,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.82ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 94.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:45:03,801 INFO L158 Benchmark]: Boogie Preprocessor took 23.86ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 93.7MB in the end (delta: 985.7kB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:45:03,801 INFO L158 Benchmark]: RCFGBuilder took 169.28ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 83.8MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2025-04-25 12:45:03,801 INFO L158 Benchmark]: TraceAbstraction took 2126.21ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.8MB in the beginning and 85.7MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:45:03,802 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.82ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 94.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 23.86ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 93.7MB in the end (delta: 985.7kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 169.28ms. Allocated memory is still 167.8MB. Free memory was 93.7MB in the beginning and 83.8MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 2126.21ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.8MB in the beginning and 85.7MB in the end (delta: -2.9MB). 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: 4014, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 37, dependent conditional: 14, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4014, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 37, dependent conditional: 14, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4014, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 37, dependent conditional: 14, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4042, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 65, dependent conditional: 42, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4042, independent: 3977, independent conditional: 0, independent unconditional: 3977, dependent: 65, dependent conditional: 10, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4042, independent: 3977, independent conditional: 0, independent unconditional: 3977, dependent: 65, dependent conditional: 10, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1309, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1309, independent: 1277, independent conditional: 0, independent unconditional: 1277, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 35, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4042, independent: 2693, independent conditional: 0, independent unconditional: 2693, dependent: 40, dependent conditional: 8, dependent unconditional: 32, unknown: 1309, unknown conditional: 2, unknown unconditional: 1307] , Statistics on independence cache: Total cache size (in pairs): 1309, Positive cache size: 1284, Positive conditional cache size: 0, Positive unconditional cache size: 1284, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2725, Maximal queried relation: 4, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 473, Number of trivial persistent sets: 262, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1307, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4014, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 37, dependent conditional: 14, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4014, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 37, dependent conditional: 14, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4014, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 37, dependent conditional: 14, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4042, independent: 3977, independent conditional: 2693, independent unconditional: 1284, dependent: 65, dependent conditional: 42, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4042, independent: 3977, independent conditional: 0, independent unconditional: 3977, dependent: 65, dependent conditional: 10, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4042, independent: 3977, independent conditional: 0, independent unconditional: 3977, dependent: 65, dependent conditional: 10, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1309, independent: 1284, independent conditional: 0, independent unconditional: 1284, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1309, independent: 1277, independent conditional: 0, independent unconditional: 1277, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 35, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4042, independent: 2693, independent conditional: 0, independent unconditional: 2693, dependent: 40, dependent conditional: 8, dependent unconditional: 32, unknown: 1309, unknown conditional: 2, unknown unconditional: 1307] , Statistics on independence cache: Total cache size (in pairs): 1309, Positive cache size: 1284, Positive conditional cache size: 0, Positive unconditional cache size: 1284, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2725, Maximal queried relation: 4, Independence queries for same thread: 0 - PositiveResult [Line: 79]: 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 9 procedures, 82 locations, 81 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 1.1s, 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: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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: 0, 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 12:45:03,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...