/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 DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_21-deref_read_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 16:47:54,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 16:47:54,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 16:47:54,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 16:47:54,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 16:47:54,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 16:47:54,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 16:47:54,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 16:47:54,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 16:47:54,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 16:47:54,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 16:47:54,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 16:47:54,783 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 16:47:54,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 16:47:54,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 16:47:54,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 16:47:54,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 16:47:54,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 16:47:54,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 16:47:54,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 16:47:54,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 16:47:54,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 16:47:54,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 16:47:54,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 16:47:54,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 16:47:54,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 16:47:54,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 16:47:54,790 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 16:47:54,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 16:47:54,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 16:47:54,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 16:47:54,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 16:47:54,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 16:47:54,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 16:47:54,792 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 16:47:54,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 16:47:54,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 16:47:54,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 16:47:54,793 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 16:47:54,793 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 -> DEFAULT 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 -> 50 [2024-04-05 16:47:55,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 16:47:55,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 16:47:55,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 16:47:55,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 16:47:55,077 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 16:47:55,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_21-deref_read_racing.i [2024-04-05 16:47:56,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 16:47:56,491 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 16:47:56,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_21-deref_read_racing.i [2024-04-05 16:47:56,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/09301b61b/0a87619e3d204acb9a91c9c30b6a9523/FLAG7e01c0fa4 [2024-04-05 16:47:56,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/09301b61b/0a87619e3d204acb9a91c9c30b6a9523 [2024-04-05 16:47:56,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 16:47:56,518 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 16:47:56,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 16:47:56,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 16:47:56,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 16:47:56,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:56,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e841ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56, skipping insertion in model container [2024-04-05 16:47:56,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:56,562 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 16:47:56,839 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_21-deref_read_racing.i[30176,30189] [2024-04-05 16:47:56,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 16:47:56,875 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 16:47:56,915 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_21-deref_read_racing.i[30176,30189] [2024-04-05 16:47:56,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 16:47:56,980 INFO L206 MainTranslator]: Completed translation [2024-04-05 16:47:56,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56 WrapperNode [2024-04-05 16:47:56,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 16:47:56,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 16:47:56,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 16:47:56,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 16:47:56,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,024 INFO L138 Inliner]: procedures = 171, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-04-05 16:47:57,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 16:47:57,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 16:47:57,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 16:47:57,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 16:47:57,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 16:47:57,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 16:47:57,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 16:47:57,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 16:47:57,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (1/1) ... [2024-04-05 16:47:57,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 16:47:57,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 16:47:57,107 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 16:47:57,111 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 16:47:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 16:47:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 16:47:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-05 16:47:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 16:47:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 16:47:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-04-05 16:47:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-04-05 16:47:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 16:47:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 16:47:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-05 16:47:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 16:47:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 16:47:57,171 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 16:47:57,277 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 16:47:57,279 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 16:47:57,426 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 16:47:57,462 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 16:47:57,462 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2024-04-05 16:47:57,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:47:57 BoogieIcfgContainer [2024-04-05 16:47:57,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 16:47:57,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 16:47:57,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 16:47:57,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 16:47:57,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 04:47:56" (1/3) ... [2024-04-05 16:47:57,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2fd31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:47:57, skipping insertion in model container [2024-04-05 16:47:57,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:47:56" (2/3) ... [2024-04-05 16:47:57,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2fd31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:47:57, skipping insertion in model container [2024-04-05 16:47:57,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:47:57" (3/3) ... [2024-04-05 16:47:57,471 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2024-04-05 16:47:57,478 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 16:47:57,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 16:47:57,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 16:47:57,485 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 16:47:57,527 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 16:47:57,564 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 16:47:57,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 16:47:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 16:47:57,572 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 16:47:57,580 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 16:47:57,606 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 16:47:57,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:57,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 16:47:57,622 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;@459bc737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 16:47:57,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 16:47:57,729 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:47:57,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -177040358, now seen corresponding path program 1 times [2024-04-05 16:47:57,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:47:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715052663] [2024-04-05 16:47:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:47:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:47:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:47:58,071 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 16:47:58,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 16:47:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715052663] [2024-04-05 16:47:58,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715052663] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 16:47:58,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 16:47:58,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 16:47:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841543870] [2024-04-05 16:47:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 16:47:58,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 16:47:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 16:47:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 16:47:58,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 16:47:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,110 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 16:47:58,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 16:47:58,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 16:47:58,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:47:58,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash 768748641, now seen corresponding path program 1 times [2024-04-05 16:47:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:47:58,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015835976] [2024-04-05 16:47:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:47:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:47:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 16:47:58,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 16:47:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 16:47:58,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 16:47:58,258 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 16:47:58,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 16:47:58,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 16:47:58,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 16:47:58,271 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-04-05 16:47:58,273 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 16:47:58,273 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 16:47:58,307 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 16:47:58,322 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 16:47:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 16:47:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 16:47:58,377 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 16:47:58,378 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 16:47:58,380 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 16:47:58,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:58,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 16:47:58,382 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;@459bc737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 16:47:58,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 16:47:58,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:47:58,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash -788939080, now seen corresponding path program 1 times [2024-04-05 16:47:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:47:58,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651805082] [2024-04-05 16:47:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:47:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:47:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:47:58,522 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 16:47:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 16:47:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651805082] [2024-04-05 16:47:58,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651805082] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 16:47:58,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 16:47:58,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 16:47:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212562385] [2024-04-05 16:47:58,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 16:47:58,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 16:47:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 16:47:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 16:47:58,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 16:47:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,525 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 16:47:58,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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 16:47:58,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 16:47:58,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:47:58,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash -739061517, now seen corresponding path program 1 times [2024-04-05 16:47:58,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:47:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063742600] [2024-04-05 16:47:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:47:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:47:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:47:58,837 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 16:47:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 16:47:58,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063742600] [2024-04-05 16:47:58,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063742600] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 16:47:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 16:47:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 16:47:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293375770] [2024-04-05 16:47:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 16:47:58,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 16:47:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 16:47:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 16:47:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 16:47:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 16:47:58,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 16:47:58,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 16:47:58,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 16:47:58,946 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:47:58,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -335560083, now seen corresponding path program 1 times [2024-04-05 16:47:58,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:47:58,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016557138] [2024-04-05 16:47:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:47:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:47:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:47:59,333 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 16:47:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 16:47:59,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016557138] [2024-04-05 16:47:59,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016557138] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 16:47:59,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 16:47:59,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 16:47:59,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675628447] [2024-04-05 16:47:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 16:47:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 16:47:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 16:47:59,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 16:47:59,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 16:47:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:59,343 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 16:47:59,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 16:47:59,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:59,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 16:47:59,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 16:47:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 16:47:59,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 16:47:59,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:47:59,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 815123630, now seen corresponding path program 1 times [2024-04-05 16:47:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:47:59,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719499035] [2024-04-05 16:47:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:47:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:47:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 16:47:59,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 16:47:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 16:47:59,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 16:47:59,512 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 16:47:59,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 16:47:59,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 16:47:59,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 16:47:59,518 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 16:47:59,518 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 16:47:59,518 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 16:47:59,554 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 16:47:59,564 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 16:47:59,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 16:47:59,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 16:47:59,567 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 16:47:59,571 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 16:47:59,574 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 16:47:59,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:59,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 16:47:59,575 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;@459bc737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 16:47:59,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 16:47:59,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:47:59,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:47:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash -833169033, now seen corresponding path program 1 times [2024-04-05 16:47:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:47:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145677787] [2024-04-05 16:47:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:47:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:47:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:47:59,711 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 16:47:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 16:47:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145677787] [2024-04-05 16:47:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145677787] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 16:47:59,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 16:47:59,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 16:47:59,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919388873] [2024-04-05 16:47:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 16:47:59,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 16:47:59,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 16:47:59,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 16:47:59,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 16:47:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:59,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 16:47:59,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 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 16:47:59,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:47:59,981 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-04-05 16:47:59,982 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 532 treesize of output 484 [2024-04-05 16:48:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1999636208, now seen corresponding path program 1 times [2024-04-05 16:48:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:48:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:48:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:48:00,196 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 16:48:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:48:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:48:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:48:00,318 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 16:48:00,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 16:48:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-05 16:48:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:48:00,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2024-04-05 16:48:00,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:48:00,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:48:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -884990343, now seen corresponding path program 1 times [2024-04-05 16:48:00,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:48:00,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31823690] [2024-04-05 16:48:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:48:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:48:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:48:00,684 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 16:48:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 16:48:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31823690] [2024-04-05 16:48:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31823690] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 16:48:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 16:48:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 16:48:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207805342] [2024-04-05 16:48:00,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 16:48:00,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 16:48:00,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 16:48:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 16:48:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-05 16:48:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:48:00,689 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 16:48:00,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 16:48:00,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:48:00,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:48:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:48:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 16:48:00,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 16:48:00,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:48:00,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:48:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1624850849, now seen corresponding path program 1 times [2024-04-05 16:48:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:48:00,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275180717] [2024-04-05 16:48:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:48:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:48:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 16:48:00,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 16:48:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 16:48:00,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 16:48:00,865 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 16:48:00,866 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-04-05 16:48:00,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-04-05 16:48:00,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-05 16:48:00,867 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 16:48:00,868 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 16:48:00,868 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 16:48:00,898 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 16:48:00,901 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 16:48:00,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 16:48:00,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 16:48:00,908 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 16:48:00,913 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 16:48:00,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:48:00,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 16:48:00,914 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;@459bc737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 16:48:00,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-04-05 16:48:00,930 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 16:48:00,976 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 16:48:00,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 16:48:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -789248809, now seen corresponding path program 1 times [2024-04-05 16:48:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 16:48:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452115927] [2024-04-05 16:48:00,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:48:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:48:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:48:01,003 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 16:48:01,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 16:48:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452115927] [2024-04-05 16:48:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452115927] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 16:48:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 16:48:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 16:48:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121257762] [2024-04-05 16:48:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 16:48:01,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 16:48:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 16:48:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 16:48:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 16:48:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:48:01,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 16:48:01,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 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 16:48:01,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 16:48:01,176 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-04-05 16:48:01,176 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 270 treesize of output 246 [2024-04-05 16:48:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -207977139, now seen corresponding path program 1 times [2024-04-05 16:48:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:48:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:48:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:48:01,366 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 16:48:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 16:48:01,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 16:48:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 16:48:01,441 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 16:48:01,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 16:48:01,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-05 16:48:01,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2024-04-05 16:48:01,576 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@4b6d9ece 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 16:48:01,580 INFO L158 Benchmark]: Toolchain (without parser) took 5061.95ms. Allocated memory was 242.2MB in the beginning and 291.5MB in the end (delta: 49.3MB). Free memory was 170.9MB in the beginning and 166.3MB in the end (delta: 4.6MB). Peak memory consumption was 55.4MB. Max. memory is 8.0GB. [2024-04-05 16:48:01,580 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 242.2MB. Free memory is still 210.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 16:48:01,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.36ms. Allocated memory is still 242.2MB. Free memory was 170.7MB in the beginning and 150.5MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-04-05 16:48:01,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.60ms. Allocated memory is still 242.2MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 16:48:01,581 INFO L158 Benchmark]: Boogie Preprocessor took 48.12ms. Allocated memory is still 242.2MB. Free memory was 148.4MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 16:48:01,581 INFO L158 Benchmark]: RCFGBuilder took 389.73ms. Allocated memory is still 242.2MB. Free memory was 146.8MB in the beginning and 197.4MB in the end (delta: -50.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2024-04-05 16:48:01,581 INFO L158 Benchmark]: TraceAbstraction took 4113.56ms. Allocated memory was 242.2MB in the beginning and 291.5MB in the end (delta: 49.3MB). Free memory was 196.3MB in the beginning and 166.3MB in the end (delta: 30.0MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. [2024-04-05 16:48:01,582 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.12ms. Allocated memory is still 242.2MB. Free memory is still 210.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.36ms. Allocated memory is still 242.2MB. Free memory was 170.7MB in the beginning and 150.5MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.60ms. Allocated memory is still 242.2MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.12ms. Allocated memory is still 242.2MB. Free memory was 148.4MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 389.73ms. Allocated memory is still 242.2MB. Free memory was 146.8MB in the beginning and 197.4MB in the end (delta: -50.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4113.56ms. Allocated memory was 242.2MB in the beginning and 291.5MB in the end (delta: 49.3MB). Free memory was 196.3MB in the beginning and 166.3MB in the end (delta: 30.0MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 260, independent: 147, independent conditional: 100, independent unconditional: 47, 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: 147, independent: 147, independent conditional: 100, independent unconditional: 47, 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: 147, independent: 147, independent conditional: 100, independent unconditional: 47, 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: 147, independent: 147, independent conditional: 100, independent unconditional: 47, 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: 147, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 147, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 147, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 57, independent: 57, independent conditional: 0, independent unconditional: 57, 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: 57, independent: 57, independent conditional: 0, independent unconditional: 57, 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: 147, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 57, unknown conditional: 0, unknown unconditional: 57] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, 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: 147, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 147, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 147, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 57, independent: 57, independent conditional: 0, independent unconditional: 57, 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: 57, independent: 57, independent conditional: 0, independent unconditional: 57, 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: 147, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 57, unknown conditional: 0, unknown unconditional: 57] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, 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: 1713, independent: 1218, independent conditional: 1026, independent unconditional: 192, dependent: 495, dependent conditional: 425, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1220, independent: 1218, independent conditional: 1026, independent unconditional: 192, 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: 1220, independent: 1218, independent conditional: 1026, independent unconditional: 192, 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: 1220, independent: 1218, independent conditional: 1026, independent unconditional: 192, 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: 1226, independent: 1218, independent conditional: 118, independent unconditional: 1100, 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: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, 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: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, 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: 233, independent: 231, independent conditional: 1, independent unconditional: 230, 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: 233, independent: 225, independent conditional: 0, independent unconditional: 225, 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: 58, independent: 46, independent conditional: 4, independent unconditional: 41, dependent: 13, dependent conditional: 9, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1226, independent: 987, independent conditional: 57, independent unconditional: 930, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 233, unknown conditional: 2, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 231, Positive conditional cache size: 1, Positive unconditional cache size: 230, 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: 60, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1226, independent: 1218, independent conditional: 118, independent unconditional: 1100, 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: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, 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: 1226, independent: 1218, independent conditional: 58, independent unconditional: 1160, 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: 233, independent: 231, independent conditional: 1, independent unconditional: 230, 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: 233, independent: 225, independent conditional: 0, independent unconditional: 225, 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: 58, independent: 46, independent conditional: 4, independent unconditional: 41, dependent: 13, dependent conditional: 9, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1226, independent: 987, independent conditional: 57, independent unconditional: 930, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 233, unknown conditional: 2, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 231, Positive conditional cache size: 1, Positive unconditional cache size: 230, 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: 60 ], Independence queries for same thread: 493 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3982, independent: 3062, independent conditional: 2620, independent unconditional: 442, dependent: 920, dependent conditional: 803, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3078, independent: 3062, independent conditional: 2620, independent unconditional: 442, dependent: 16, dependent conditional: 13, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3078, independent: 3062, independent conditional: 2620, independent unconditional: 442, dependent: 16, dependent conditional: 13, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3078, independent: 3062, independent conditional: 2620, independent unconditional: 442, dependent: 16, dependent conditional: 13, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3113, independent: 3062, independent conditional: 275, independent unconditional: 2787, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3113, independent: 3062, independent conditional: 134, independent unconditional: 2928, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3113, independent: 3062, independent conditional: 134, independent unconditional: 2928, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 489, independent: 475, independent conditional: 8, independent unconditional: 467, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 489, independent: 463, independent conditional: 0, independent unconditional: 463, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 62, independent conditional: 15, independent unconditional: 47, dependent: 29, dependent conditional: 7, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3113, independent: 2587, independent conditional: 126, independent unconditional: 2461, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 489, unknown conditional: 12, unknown unconditional: 477] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 475, Positive conditional cache size: 8, Positive unconditional cache size: 467, Negative cache size: 14, Negative conditional cache size: 4, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 146, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3113, independent: 3062, independent conditional: 275, independent unconditional: 2787, dependent: 51, dependent conditional: 13, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3113, independent: 3062, independent conditional: 134, independent unconditional: 2928, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3113, independent: 3062, independent conditional: 134, independent unconditional: 2928, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 489, independent: 475, independent conditional: 8, independent unconditional: 467, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 489, independent: 463, independent conditional: 0, independent unconditional: 463, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 62, independent conditional: 15, independent unconditional: 47, dependent: 29, dependent conditional: 7, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3113, independent: 2587, independent conditional: 126, independent unconditional: 2461, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 489, unknown conditional: 12, unknown unconditional: 477] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 475, Positive conditional cache size: 8, Positive unconditional cache size: 467, Negative cache size: 14, Negative conditional cache size: 4, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 146 ], Independence queries for same thread: 904 - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@4b6d9ece de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@4b6d9ece: 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 16:48:01,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-04-05 16:48:01,805 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 16:48:02,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-04-05 16:48:02,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-05 16:48:02,411 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...