/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 19:41:19,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 19:41:19,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 19:41:19,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 19:41:19,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 19:41:19,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 19:41:19,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 19:41:19,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 19:41:19,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 19:41:19,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 19:41:19,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 19:41:19,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 19:41:19,415 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 19:41:19,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 19:41:19,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 19:41:19,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 19:41:19,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 19:41:19,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 19:41:19,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 19:41:19,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 19:41:19,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 19:41:19,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 19:41:19,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 19:41:19,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 19:41:19,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 19:41:19,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 19:41:19,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 19:41:19,420 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 19:41:19,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 19:41:19,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 19:41:19,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 19:41:19,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 19:41:19,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 19:41:19,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 19:41:19,422 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 19:41:19,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 19:41:19,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 19:41:19,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 19:41:19,423 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 19:41:19,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-05 19:41:19,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 19:41:19,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 19:41:19,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 19:41:19,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 19:41:19,680 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 19:41:19,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i [2024-04-05 19:41:20,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 19:41:21,046 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 19:41:21,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i [2024-04-05 19:41:21,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6ca141ba6/067bc159ee86420e887133cc90096a73/FLAG200ad5f57 [2024-04-05 19:41:21,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6ca141ba6/067bc159ee86420e887133cc90096a73 [2024-04-05 19:41:21,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 19:41:21,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 19:41:21,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 19:41:21,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 19:41:21,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 19:41:21,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba26e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21, skipping insertion in model container [2024-04-05 19:41:21,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,120 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 19:41:21,358 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i[30176,30189] [2024-04-05 19:41:21,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 19:41:21,392 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 19:41:21,427 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_11-ptr_racing.i[30176,30189] [2024-04-05 19:41:21,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 19:41:21,504 INFO L206 MainTranslator]: Completed translation [2024-04-05 19:41:21,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21 WrapperNode [2024-04-05 19:41:21,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 19:41:21,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 19:41:21,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 19:41:21,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 19:41:21,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,566 INFO L138 Inliner]: procedures = 171, calls = 48, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-04-05 19:41:21,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 19:41:21,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 19:41:21,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 19:41:21,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 19:41:21,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 19:41:21,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 19:41:21,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 19:41:21,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 19:41:21,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (1/1) ... [2024-04-05 19:41:21,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 19:41:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:41:21,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 19:41:21,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 19:41:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 19:41:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 19:41:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-05 19:41:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 19:41:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 19:41:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-04-05 19:41:21,708 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-04-05 19:41:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 19:41:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 19:41:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-05 19:41:21,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 19:41:21,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 19:41:21,711 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 19:41:21,807 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 19:41:21,808 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 19:41:21,991 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 19:41:22,022 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 19:41:22,023 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2024-04-05 19:41:22,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:41:22 BoogieIcfgContainer [2024-04-05 19:41:22,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 19:41:22,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 19:41:22,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 19:41:22,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 19:41:22,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 07:41:21" (1/3) ... [2024-04-05 19:41:22,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e78fa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:41:22, skipping insertion in model container [2024-04-05 19:41:22,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 07:41:21" (2/3) ... [2024-04-05 19:41:22,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e78fa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 07:41:22, skipping insertion in model container [2024-04-05 19:41:22,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 07:41:22" (3/3) ... [2024-04-05 19:41:22,035 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2024-04-05 19:41:22,042 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 19:41:22,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 19:41:22,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 19:41:22,050 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 19:41:22,106 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-04-05 19:41:22,140 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:41:22,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:41:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:41:22,144 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) [2024-04-05 19:41:22,180 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 [2024-04-05 19:41:22,187 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:41:22,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:22,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:41:22,215 INFO L357 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, mHoare=true, 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;@1ec73031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:41:22,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 19:41:22,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:22,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash -377168601, now seen corresponding path program 1 times [2024-04-05 19:41:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:22,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202973932] [2024-04-05 19:41:22,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:41:22,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:22,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202973932] [2024-04-05 19:41:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202973932] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:22,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:22,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:41:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347875545] [2024-04-05 19:41:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:22,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:41:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:41:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:41:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:22,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:22,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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) [2024-04-05 19:41:22,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:22,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 19:41:22,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:22,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1451766510, now seen corresponding path program 1 times [2024-04-05 19:41:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665011691] [2024-04-05 19:41:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:22,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:41:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:22,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:41:22,744 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:41:22,745 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 19:41:22,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 19:41:22,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 19:41:22,750 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-04-05 19:41:22,752 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:41:22,752 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 19:41:22,785 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 19:41:22,794 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:41:22,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:41:22,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:41:22,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 19:41:22,811 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:41:22,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:22,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:41:22,813 INFO L357 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, mHoare=true, 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;@1ec73031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:41:22,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 19:41:22,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-04-05 19:41:22,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:22,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1663130713, now seen corresponding path program 1 times [2024-04-05 19:41:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925051127] [2024-04-05 19:41:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:41:22,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:22,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925051127] [2024-04-05 19:41:22,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925051127] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:22,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:22,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:41:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167141931] [2024-04-05 19:41:22,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:22,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:41:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:22,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:41:22,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:41:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:22,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:22,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 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) [2024-04-05 19:41:22,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:22,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 19:41:22,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:22,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1159261964, now seen corresponding path program 1 times [2024-04-05 19:41:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465788610] [2024-04-05 19:41:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:41:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465788610] [2024-04-05 19:41:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465788610] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 19:41:23,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116631187] [2024-04-05 19:41:23,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:23,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 19:41:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 19:41:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 19:41:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:23,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2024-04-05 19:41:23,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:23,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 19:41:23,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:23,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 536807111, now seen corresponding path program 1 times [2024-04-05 19:41:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050974298] [2024-04-05 19:41:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 19:41:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050974298] [2024-04-05 19:41:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050974298] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 19:41:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884452507] [2024-04-05 19:41:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:23,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 19:41:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:23,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 19:41:23,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 19:41:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:23,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2024-04-05 19:41:23,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:23,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 19:41:23,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 19:41:23,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:23,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 798735400, now seen corresponding path program 1 times [2024-04-05 19:41:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290833926] [2024-04-05 19:41:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:23,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:41:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:23,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:41:23,773 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:41:23,773 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 19:41:23,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 19:41:23,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 19:41:23,778 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 19:41:23,778 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:41:23,778 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 19:41:23,814 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-04-05 19:41:23,818 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:41:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:41:23,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:41:23,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 19:41:23,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-04-05 19:41:23,873 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:41:23,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:23,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:41:23,874 INFO L357 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, mHoare=true, 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;@1ec73031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:41:23,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 19:41:23,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:23,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1383303718, now seen corresponding path program 1 times [2024-04-05 19:41:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007349127] [2024-04-05 19:41:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-04-05 19:41:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007349127] [2024-04-05 19:41:23,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007349127] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:23,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:41:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15047418] [2024-04-05 19:41:23,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:23,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:41:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:23,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:41:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:41:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:23,931 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 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) [2024-04-05 19:41:23,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 19:41:24,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:24,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash 404151021, now seen corresponding path program 1 times [2024-04-05 19:41:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:24,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832409635] [2024-04-05 19:41:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 19:41:24,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832409635] [2024-04-05 19:41:24,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832409635] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:24,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:24,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 19:41:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099979824] [2024-04-05 19:41:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:24,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 19:41:24,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:24,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 19:41:24,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 19:41:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,121 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:24,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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) [2024-04-05 19:41:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:24,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-04-05 19:41:24,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:24,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash 464252121, now seen corresponding path program 1 times [2024-04-05 19:41:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809171555] [2024-04-05 19:41:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-05 19:41:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:24,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809171555] [2024-04-05 19:41:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809171555] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:24,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 19:41:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981380141] [2024-04-05 19:41:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:24,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 19:41:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:24,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 19:41:24,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 19:41:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:24,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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) [2024-04-05 19:41:24,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:24,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 19:41:24,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-04-05 19:41:24,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:24,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1119354933, now seen corresponding path program 1 times [2024-04-05 19:41:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:24,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265245103] [2024-04-05 19:41:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:24,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:24,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:41:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:24,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:41:24,628 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:41:24,628 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 19:41:24,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 19:41:24,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 19:41:24,630 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 19:41:24,630 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:41:24,631 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 19:41:24,663 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-05 19:41:24,666 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:41:24,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:41:24,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:41:24,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 19:41:24,704 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:41:24,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:24,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:41:24,705 INFO L357 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, mHoare=true, 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;@1ec73031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:41:24,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 19:41:24,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-04-05 19:41:24,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:24,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash -591905768, now seen corresponding path program 1 times [2024-04-05 19:41:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960220893] [2024-04-05 19:41:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-04-05 19:41:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960220893] [2024-04-05 19:41:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960220893] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:24,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:41:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951235638] [2024-04-05 19:41:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:24,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:41:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:41:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:41:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,757 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:24,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 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) [2024-04-05 19:41:24,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-05 19:41:24,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:24,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1549430185, now seen corresponding path program 1 times [2024-04-05 19:41:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:24,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562599518] [2024-04-05 19:41:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:24,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 19:41:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:24,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562599518] [2024-04-05 19:41:24,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562599518] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:24,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:24,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 19:41:24,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361779288] [2024-04-05 19:41:24,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:24,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 19:41:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 19:41:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 19:41:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:24,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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) [2024-04-05 19:41:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:24,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:25,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-05 19:41:25,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:25,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1727337187, now seen corresponding path program 1 times [2024-04-05 19:41:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:25,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768935574] [2024-04-05 19:41:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-04-05 19:41:25,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:25,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768935574] [2024-04-05 19:41:25,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768935574] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:25,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:25,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 19:41:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387725667] [2024-04-05 19:41:25,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:25,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 19:41:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 19:41:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 19:41:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:25,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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) [2024-04-05 19:41:25,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:25,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 19:41:25,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 19:41:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-05 19:41:25,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:25,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1901975025, now seen corresponding path program 1 times [2024-04-05 19:41:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:25,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10929595] [2024-04-05 19:41:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:25,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 19:41:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 19:41:25,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 19:41:25,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 19:41:25,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 19:41:25,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 19:41:25,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-04-05 19:41:25,384 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 19:41:25,384 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 19:41:25,384 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-05 19:41:25,407 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-05 19:41:25,409 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 19:41:25,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 19:41:25,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 19:41:25,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 19:41:25,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-04-05 19:41:25,449 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 19:41:25,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:25,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 19:41:25,450 INFO L357 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, mHoare=true, 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;@1ec73031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 19:41:25,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 19:41:25,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 19:41:25,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 19:41:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1934117219, now seen corresponding path program 1 times [2024-04-05 19:41:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 19:41:25,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318320199] [2024-04-05 19:41:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-04-05 19:41:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 19:41:25,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318320199] [2024-04-05 19:41:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318320199] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 19:41:25,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 19:41:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 19:41:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475111451] [2024-04-05 19:41:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 19:41:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 19:41:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 19:41:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 19:41:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 19:41:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,498 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 19:41:25,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 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) [2024-04-05 19:41:25,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 19:41:25,678 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-04-05 19:41:25,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 502 [2024-04-05 19:41:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1509406235, now seen corresponding path program 1 times [2024-04-05 19:41:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:25,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:41:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 19:41:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 19:41:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 19:41:25,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 19:41:25,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 19:41:25,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-05 19:41:26,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-04-05 19:41:26,095 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7e37fd17 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:183) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-05 19:41:26,100 INFO L158 Benchmark]: Toolchain (without parser) took 5022.10ms. Allocated memory was 292.6MB in the beginning and 399.5MB in the end (delta: 107.0MB). Free memory was 220.2MB in the beginning and 318.9MB in the end (delta: -98.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2024-04-05 19:41:26,100 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 19:41:26,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.77ms. Allocated memory is still 292.6MB. Free memory was 220.0MB in the beginning and 257.1MB in the end (delta: -37.1MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. [2024-04-05 19:41:26,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.10ms. Allocated memory is still 292.6MB. Free memory was 257.1MB in the beginning and 255.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 19:41:26,101 INFO L158 Benchmark]: Boogie Preprocessor took 34.09ms. Allocated memory is still 292.6MB. Free memory was 255.1MB in the beginning and 253.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 19:41:26,101 INFO L158 Benchmark]: RCFGBuilder took 425.99ms. Allocated memory is still 292.6MB. Free memory was 253.0MB in the beginning and 234.7MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-04-05 19:41:26,101 INFO L158 Benchmark]: TraceAbstraction took 4070.30ms. Allocated memory was 292.6MB in the beginning and 399.5MB in the end (delta: 107.0MB). Free memory was 233.6MB in the beginning and 318.9MB in the end (delta: -85.3MB). Peak memory consumption was 21.7MB. Max. memory is 8.0GB. [2024-04-05 19:41:26,102 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.77ms. Allocated memory is still 292.6MB. Free memory was 220.0MB in the beginning and 257.1MB in the end (delta: -37.1MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.10ms. Allocated memory is still 292.6MB. Free memory was 257.1MB in the beginning and 255.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.09ms. Allocated memory is still 292.6MB. Free memory was 255.1MB in the beginning and 253.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 425.99ms. Allocated memory is still 292.6MB. Free memory was 253.0MB in the beginning and 234.7MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4070.30ms. Allocated memory was 292.6MB in the beginning and 399.5MB in the end (delta: 107.0MB). Free memory was 233.6MB in the beginning and 318.9MB in the end (delta: -85.3MB). Peak memory consumption was 21.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 266, independent: 153, independent conditional: 104, independent unconditional: 49, dependent: 113, dependent conditional: 83, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 153, independent: 153, independent conditional: 104, independent unconditional: 49, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 153, independent conditional: 104, independent unconditional: 49, 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: 153, independent: 153, independent conditional: 104, independent unconditional: 49, 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: 153, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 153, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 153, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 53, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 53, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 153, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, 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: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 153, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 153, independent: 153, independent conditional: 0, independent unconditional: 153, 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: 53, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 53, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 153, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, 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: 0 ], Independence queries for same thread: 113 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1761, independent: 1260, independent conditional: 1061, independent unconditional: 199, dependent: 501, dependent conditional: 431, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1262, independent: 1260, independent conditional: 1061, independent unconditional: 199, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1262, independent: 1260, independent conditional: 1061, independent unconditional: 199, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1262, independent: 1260, independent conditional: 1061, independent unconditional: 199, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1268, independent: 1260, independent conditional: 125, independent unconditional: 1135, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1268, independent: 1260, independent conditional: 62, independent unconditional: 1198, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1268, independent: 1260, independent conditional: 62, independent unconditional: 1198, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 237, independent conditional: 1, independent unconditional: 236, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 32, independent conditional: 3, independent unconditional: 30, dependent: 9, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1268, independent: 1023, independent conditional: 61, independent unconditional: 962, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 239, unknown conditional: 2, unknown unconditional: 237] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 237, Positive conditional cache size: 1, Positive unconditional cache size: 236, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1268, independent: 1260, independent conditional: 125, independent unconditional: 1135, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1268, independent: 1260, independent conditional: 62, independent unconditional: 1198, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1268, independent: 1260, independent conditional: 62, independent unconditional: 1198, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 237, independent conditional: 1, independent unconditional: 236, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 32, independent conditional: 3, independent unconditional: 30, dependent: 9, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1268, independent: 1023, independent conditional: 61, independent unconditional: 962, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 239, unknown conditional: 2, unknown unconditional: 237] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 237, Positive conditional cache size: 1, Positive unconditional cache size: 236, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63 ], Independence queries for same thread: 499 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4631, independent: 3585, independent conditional: 3023, independent unconditional: 562, dependent: 1046, dependent conditional: 913, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3602, independent: 3585, independent conditional: 3023, independent unconditional: 562, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3602, independent: 3585, independent conditional: 3023, independent unconditional: 562, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3602, independent: 3585, independent conditional: 3023, independent unconditional: 562, dependent: 17, dependent conditional: 14, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3639, independent: 3585, independent conditional: 293, independent unconditional: 3292, dependent: 54, dependent conditional: 14, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3639, independent: 3585, independent conditional: 143, independent unconditional: 3442, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3639, independent: 3585, independent conditional: 143, independent unconditional: 3442, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 591, independent: 578, independent conditional: 5, independent unconditional: 573, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 591, independent: 562, independent conditional: 0, independent unconditional: 562, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 51, independent conditional: 13, independent unconditional: 38, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3639, independent: 3007, independent conditional: 138, independent unconditional: 2869, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 591, unknown conditional: 9, unknown unconditional: 582] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 578, Positive conditional cache size: 5, Positive unconditional cache size: 573, Negative cache size: 13, Negative conditional cache size: 4, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 156, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3639, independent: 3585, independent conditional: 293, independent unconditional: 3292, dependent: 54, dependent conditional: 14, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3639, independent: 3585, independent conditional: 143, independent unconditional: 3442, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3639, independent: 3585, independent conditional: 143, independent unconditional: 3442, dependent: 54, dependent conditional: 8, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 591, independent: 578, independent conditional: 5, independent unconditional: 573, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 591, independent: 562, independent conditional: 0, independent unconditional: 562, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 13, dependent conditional: 4, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 51, independent conditional: 13, independent unconditional: 38, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3639, independent: 3007, independent conditional: 138, independent unconditional: 2869, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 591, unknown conditional: 9, unknown unconditional: 582] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 578, Positive conditional cache size: 5, Positive unconditional cache size: 573, Negative cache size: 13, Negative conditional cache size: 4, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 156 ], Independence queries for same thread: 1029 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7107, independent: 5579, independent conditional: 4690, independent unconditional: 889, dependent: 1528, dependent conditional: 1338, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5604, independent: 5579, independent conditional: 4690, independent unconditional: 889, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5604, independent: 5579, independent conditional: 4690, independent unconditional: 889, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5604, independent: 5579, independent conditional: 4690, independent unconditional: 889, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5655, independent: 5579, independent conditional: 428, independent unconditional: 5151, dependent: 76, dependent conditional: 20, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5655, independent: 5579, independent conditional: 207, independent unconditional: 5372, dependent: 76, dependent conditional: 10, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5655, independent: 5579, independent conditional: 207, independent unconditional: 5372, dependent: 76, dependent conditional: 10, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 914, independent: 896, independent conditional: 8, independent unconditional: 888, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 914, independent: 877, independent conditional: 0, independent unconditional: 877, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 52, independent conditional: 5, independent unconditional: 47, dependent: 28, dependent conditional: 7, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5655, independent: 4683, independent conditional: 199, independent unconditional: 4484, dependent: 58, dependent conditional: 5, dependent unconditional: 53, unknown: 914, unknown conditional: 13, unknown unconditional: 901] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 896, Positive conditional cache size: 8, Positive unconditional cache size: 888, Negative cache size: 18, Negative conditional cache size: 5, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 231, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5655, independent: 5579, independent conditional: 428, independent unconditional: 5151, dependent: 76, dependent conditional: 20, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5655, independent: 5579, independent conditional: 207, independent unconditional: 5372, dependent: 76, dependent conditional: 10, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5655, independent: 5579, independent conditional: 207, independent unconditional: 5372, dependent: 76, dependent conditional: 10, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 914, independent: 896, independent conditional: 8, independent unconditional: 888, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 914, independent: 877, independent conditional: 0, independent unconditional: 877, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 52, independent conditional: 5, independent unconditional: 47, dependent: 28, dependent conditional: 7, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5655, independent: 4683, independent conditional: 199, independent unconditional: 4484, dependent: 58, dependent conditional: 5, dependent unconditional: 53, unknown: 914, unknown conditional: 13, unknown unconditional: 901] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 896, Positive conditional cache size: 8, Positive unconditional cache size: 888, Negative cache size: 18, Negative conditional cache size: 5, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 231 ], Independence queries for same thread: 1503 - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7e37fd17 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@7e37fd17: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-05 19:41:26,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-04-05 19:41:26,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-04-05 19:41:26,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-04-05 19:41:26,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-04-05 19:41:26,918 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 [2024-04-05 19:41:27,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...