/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/popl20-more/vector-add.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 12:40:30,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 12:40:30,934 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:40:30,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 12:40:30,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 12:40:30,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 12:40:30,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 12:40:30,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 12:40:30,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 12:40:30,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 12:40:30,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 12:40:30,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 12:40:30,961 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 12:40:30,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 12:40:30,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 12:40:30,962 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 12:40:30,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 12:40:30,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 12:40:30,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 12:40:30,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 12:40:30,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 12:40:30,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:40:30,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 12:40:30,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:40:30,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 12:40:30,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 12:40:30,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 12:40:30,965 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 12:40:30,965 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 12:40:30,965 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:40:31,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 12:40:31,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 12:40:31,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 12:40:31,180 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 12:40:31,182 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 12:40:31,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/vector-add.wvr.bpl [2025-04-25 12:40:31,183 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/vector-add.wvr.bpl' [2025-04-25 12:40:31,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 12:40:31,202 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 12:40:31,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 12:40:31,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 12:40:31,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 12:40:31,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,228 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 12:40:31,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 12:40:31,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 12:40:31,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 12:40:31,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 12:40:31,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 12:40:31,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 12:40:31,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 12:40:31,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 12:40:31,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/1) ... [2025-04-25 12:40:31,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 12:40:31,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:40:31,281 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:40:31,285 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:40:31,305 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 12:40:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 12:40:31,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 12:40:31,305 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 12:40:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 12:40:31,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 12:40:31,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 12:40:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 12:40:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 12:40:31,306 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-25 12:40:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 12:40:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 12:40:31,306 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:40:31,344 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 12:40:31,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 12:40:31,429 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 12:40:31,429 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 12:40:31,445 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 12:40:31,445 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 12:40:31,445 INFO L201 PluginConnector]: Adding new model vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:40:31 BoogieIcfgContainer [2025-04-25 12:40:31,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 12:40:31,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 12:40:31,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 12:40:31,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 12:40:31,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 12:40:31" (1/2) ... [2025-04-25 12:40:31,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43307677 and model type vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:40:31, skipping insertion in model container [2025-04-25 12:40:31,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:40:31" (2/2) ... [2025-04-25 12:40:31,455 INFO L128 eAbstractionObserver]: Analyzing ICFG vector-add.wvr.bpl [2025-04-25 12:40:31,464 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 12:40:31,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG vector-add.wvr.bpl that has 4 procedures, 28 locations, 27 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-25 12:40:31,466 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 12:40:31,500 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 12:40:31,530 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:40:31,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 12:40:31,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:40:31,532 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:40:31,533 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:40:31,569 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 12:40:31,586 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 12:40:31,591 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;@528e672e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 12:40:31,591 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 12:40:31,633 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:31,633 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:31,633 INFO L139 ounterexampleChecker]: Examining path program with hash 566431381, occurence #1 [2025-04-25 12:40:31,633 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:40:31,634 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:31,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash -956733089, now seen corresponding path program 1 times [2025-04-25 12:40:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:31,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305882204] [2025-04-25 12:40:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:40:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:31,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-25 12:40:31,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-25 12:40:31,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:40:31,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:31,771 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:40:31,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:31,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305882204] [2025-04-25 12:40:31,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305882204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:40:31,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:40:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 12:40:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622307645] [2025-04-25 12:40:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:40:31,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 12:40:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:40:31,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 12:40:31,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 12:40:31,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:31,791 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:40:31,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:40:31,791 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:31,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:31,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 12:40:31,821 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:31,821 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:31,821 INFO L139 ounterexampleChecker]: Examining path program with hash 1996993873, occurence #1 [2025-04-25 12:40:31,821 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:40:31,821 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:31,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 607947613, now seen corresponding path program 1 times [2025-04-25 12:40:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:31,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317582166] [2025-04-25 12:40:31,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:40:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:31,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-25 12:40:31,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 12:40:31,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:40:31,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 12:40:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:31,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317582166] [2025-04-25 12:40:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317582166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:40:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:40:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 12:40:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841816898] [2025-04-25 12:40:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:40:31,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 12:40:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:40:31,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 12:40:31,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 12:40:31,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:31,932 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:40:31,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:40:31,933 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:31,933 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:31,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:31,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:31,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 12:40:31,999 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:32,000 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:32,000 INFO L139 ounterexampleChecker]: Examining path program with hash -492271499, occurence #1 [2025-04-25 12:40:32,000 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:40:32,000 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:32,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1966992537, now seen corresponding path program 1 times [2025-04-25 12:40:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:32,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167738055] [2025-04-25 12:40:32,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:40:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:32,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-25 12:40:32,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 12:40:32,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:40:32,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:32,062 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:40:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:32,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167738055] [2025-04-25 12:40:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167738055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:40:32,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:40:32,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 12:40:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144666551] [2025-04-25 12:40:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:40:32,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 12:40:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:40:32,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 12:40:32,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 12:40:32,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:32,063 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:40:32,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:40:32,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:32,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:32,064 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:32,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:32,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:32,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:32,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 12:40:32,119 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:32,119 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:32,119 INFO L139 ounterexampleChecker]: Examining path program with hash 1487910156, occurence #1 [2025-04-25 12:40:32,119 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:40:32,119 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:32,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1509935081, now seen corresponding path program 1 times [2025-04-25 12:40:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:32,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354848717] [2025-04-25 12:40:32,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 12:40:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:32,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 12:40:32,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 12:40:32,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 12:40:32,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:32,536 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:40:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:32,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354848717] [2025-04-25 12:40:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354848717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:40:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:40:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-25 12:40:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158513514] [2025-04-25 12:40:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:40:32,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-25 12:40:32,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:40:32,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-25 12:40:32,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-25 12:40:32,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:32,538 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:40:32,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:40:32,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:32,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:32,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:32,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:32,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:32,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:32,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:32,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:40:32,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 12:40:32,689 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:32,689 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:32,689 INFO L139 ounterexampleChecker]: Examining path program with hash -1376494648, occurence #1 [2025-04-25 12:40:32,689 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:40:32,689 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:32,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1556778005, now seen corresponding path program 2 times [2025-04-25 12:40:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:32,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400995605] [2025-04-25 12:40:32,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 12:40:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:32,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-25 12:40:32,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 12:40:32,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 12:40:32,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:32,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:32,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400995605] [2025-04-25 12:40:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400995605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 12:40:32,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 12:40:32,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 12:40:32,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75497079] [2025-04-25 12:40:32,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 12:40:32,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 12:40:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:40:32,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 12:40:32,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-25 12:40:32,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:32,756 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:40:32,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:40:32,757 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:32,757 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:32,757 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:32,757 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:40:32,757 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:32,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:32,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:32,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:32,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:40:32,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 12:40:32,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 12:40:32,876 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:32,876 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:32,876 INFO L139 ounterexampleChecker]: Examining path program with hash 2126857571, occurence #1 [2025-04-25 12:40:32,876 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:40:32,876 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:32,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1988160107, now seen corresponding path program 3 times [2025-04-25 12:40:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:32,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724309410] [2025-04-25 12:40:32,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 12:40:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:32,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-25 12:40:32,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 12:40:32,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 12:40:32,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:32,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:32,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724309410] [2025-04-25 12:40:32,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724309410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 12:40:32,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678233227] [2025-04-25 12:40:32,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 12:40:32,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:40:32,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:40:32,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 12:40:32,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 12:40:32,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-25 12:40:33,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 12:40:33,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 12:40:33,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:33,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 12:40:33,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 12:40:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:33,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 12:40:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678233227] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 12:40:33,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 12:40:33,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-04-25 12:40:33,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309875555] [2025-04-25 12:40:33,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 12:40:33,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 12:40:33,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:40:33,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 12:40:33,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-25 12:40:33,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:33,177 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:40:33,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 12:40:33,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:33,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:33,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:33,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:40:33,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 12:40:33,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:33,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:33,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:33,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:33,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:40:33,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 12:40:33,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 12:40:33,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-25 12:40:33,564 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,SelfDestructingSolverStorable5 [2025-04-25 12:40:33,564 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:33,565 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:33,565 INFO L139 ounterexampleChecker]: Examining path program with hash 405572924, occurence #1 [2025-04-25 12:40:33,565 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 12:40:33,565 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:33,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1365569005, now seen corresponding path program 4 times [2025-04-25 12:40:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:33,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999412484] [2025-04-25 12:40:33,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 12:40:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:33,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-25 12:40:33,594 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 12:40:33,594 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 12:40:33,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:33,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999412484] [2025-04-25 12:40:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999412484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 12:40:33,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808188841] [2025-04-25 12:40:33,911 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 12:40:33,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:40:33,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:40:33,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 12:40:33,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 12:40:33,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-25 12:40:33,943 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 12:40:33,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 12:40:33,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:33,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-25 12:40:33,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 12:40:34,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2025-04-25 12:40:34,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-04-25 12:40:34,173 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2025-04-25 12:40:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:34,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 12:40:34,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 12:40:34,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 80 [2025-04-25 12:40:34,342 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 12:40:34,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 68 [2025-04-25 12:40:44,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 960 treesize of output 912 [2025-04-25 12:40:44,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 163 [2025-04-25 12:40:44,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 163 [2025-04-25 12:40:44,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 846 [2025-04-25 12:40:44,659 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 476 treesize of output 452 [2025-04-25 12:40:44,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 846 [2025-04-25 12:40:44,734 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 163 [2025-04-25 12:40:44,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 444 treesize of output 420 [2025-04-25 12:40:44,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 846 [2025-04-25 12:40:44,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 167 [2025-04-25 12:40:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808188841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 12:40:44,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 12:40:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-04-25 12:40:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613357442] [2025-04-25 12:40:44,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 12:40:44,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-25 12:40:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 12:40:44,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-25 12:40:44,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=595, Unknown=1, NotChecked=0, Total=702 [2025-04-25 12:40:44,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:44,995 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 12:40:44,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 26 states have internal predecessors, (64), 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:40:44,995 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:44,996 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:44,996 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:44,996 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:40:44,996 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 12:40:44,996 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-25 12:40:44,996 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 12:40:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 12:40:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 12:40:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 12:40:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 12:40:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 12:40:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 12:40:46,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-25 12:40:46,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-25 12:40:46,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:40:46,586 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 12:40:46,586 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 12:40:46,586 INFO L139 ounterexampleChecker]: Examining path program with hash 405572924, occurence #2 [2025-04-25 12:40:46,586 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 12:40:46,586 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-25 12:40:46,587 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:40:46,587 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 12:40:46,587 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:40:46,587 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-25 12:40:46,587 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:40:46,587 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-04-25 12:40:46,587 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 12:40:46,587 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-25 12:40:46,587 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 12:40:46,587 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 12:40:46,587 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 12:40:46,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 12:40:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1643140085, now seen corresponding path program 5 times [2025-04-25 12:40:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 12:40:46,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073641398] [2025-04-25 12:40:46,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 12:40:46,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 12:40:46,592 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-04-25 12:40:46,615 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-25 12:40:46,616 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-25 12:40:46,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-25 12:40:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 12:40:47,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073641398] [2025-04-25 12:40:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073641398] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 12:40:47,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051185906] [2025-04-25 12:40:47,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 12:40:47,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:40:47,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 12:40:47,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 12:40:47,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 12:40:47,118 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-04-25 12:40:47,127 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-25 12:40:47,127 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-25 12:40:47,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 12:40:47,128 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-25 12:40:47,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 12:40:47,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2025-04-25 12:40:47,356 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2025-04-25 12:40:47,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2025-04-25 12:40:47,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2025-04-25 12:40:47,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-04-25 12:40:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 12:40:47,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 12:40:48,022 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 12:40:48,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 240 [2025-04-25 12:40:48,150 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 12:40:48,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 87 treesize of output 212 [2025-04-25 12:45:07,111 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 24496 DAG size of output: 24740 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-25 12:50:31,365 WARN L286 SmtUtils]: Spent 47.02s on a formula simplification. DAG size of input: 94070 DAG size of output: 100587 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-25 12:51:43,098 WARN L286 SmtUtils]: Spent 58.53s on a formula simplification. DAG size of input: 87497 DAG size of output: 89476 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-25 12:51:56,452 WARN L286 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 87123 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-25 12:54:51,270 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 12:54:51,270 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 12:54:51,270 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-25 12:54:51,292 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2025-04-25 12:54:51,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 12:54:51,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 12:54:51,493 WARN L610 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 36 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-12-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-17-2-1 context. [2025-04-25 12:54:51,494 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-25 12:54:51,494 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-25 12:54:51,495 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-25 12:54:51,498 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2025-04-25 12:54:51,499 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 12:54:51,499 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 12:54:51,508 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 12:54:51,508 INFO L201 PluginConnector]: Adding new model vector-add.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 12:54:51 BasicIcfg [2025-04-25 12:54:51,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 12:54:51,509 INFO L158 Benchmark]: Toolchain (without parser) took 860306.47ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 98.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2025-04-25 12:54:51,509 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:54:51,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.63ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:54:51,509 INFO L158 Benchmark]: Boogie Preprocessor took 24.53ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 96.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 12:54:51,510 INFO L158 Benchmark]: RCFGBuilder took 188.50ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 86.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 12:54:51,510 INFO L158 Benchmark]: TraceAbstraction took 860061.11ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 85.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2025-04-25 12:54:51,511 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.18ms. Allocated memory is still 167.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.63ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 97.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 24.53ms. Allocated memory is still 167.8MB. Free memory was 97.3MB in the beginning and 96.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 188.50ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 86.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 860061.11ms. Allocated memory was 167.8MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 85.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. 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: 977, independent: 797, independent conditional: 472, independent unconditional: 325, dependent: 180, dependent conditional: 180, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 797, independent: 797, independent conditional: 472, independent unconditional: 325, 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: 797, independent: 797, independent conditional: 472, independent unconditional: 325, 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: 797, independent: 797, independent conditional: 472, independent unconditional: 325, 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: 797, independent: 797, independent conditional: 0, independent unconditional: 797, 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: 797, independent: 797, independent conditional: 0, independent unconditional: 797, 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: 316, independent: 316, independent conditional: 0, independent unconditional: 316, 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: 316, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 797, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 316, unknown conditional: 0, unknown unconditional: 316] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 316, Positive conditional cache size: 0, Positive unconditional cache size: 316, 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: 472, Maximal queried relation: 0, Independence queries for same thread: 180, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 37, Number of trivial persistent sets: 21, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 325, independent: 325, independent conditional: 0, independent unconditional: 325, 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: 977, independent: 797, independent conditional: 472, independent unconditional: 325, dependent: 180, dependent conditional: 180, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 797, independent: 797, independent conditional: 472, independent unconditional: 325, 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: 797, independent: 797, independent conditional: 472, independent unconditional: 325, 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: 797, independent: 797, independent conditional: 472, independent unconditional: 325, 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: 797, independent: 797, independent conditional: 0, independent unconditional: 797, 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: 797, independent: 797, independent conditional: 0, independent unconditional: 797, 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: 316, independent: 316, independent conditional: 0, independent unconditional: 316, 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: 316, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 797, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 316, unknown conditional: 0, unknown unconditional: 316] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 316, Positive conditional cache size: 0, Positive unconditional cache size: 316, 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: 472, Maximal queried relation: 0, Independence queries for same thread: 180 - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 36 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-12-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-17-2-1 context. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 36 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-12-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-17-2-1 context. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 36 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-12-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-17-2-1 context. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 36 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-12-1 term,while PolyPacSimplificationTermWalker was simplifying 12 xjuncts wrt. a ∧-17-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 43 locations, 48 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 859.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 2.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 68, 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, 12.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 254 ConstructedInterpolants, 5 QuantifiedInterpolants, 27569 SizeOfPredicates, 17 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 2/14 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: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown