/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 02:08:54,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 02:08:54,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 02:08:54,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 02:08:54,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 02:08:54,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 02:08:54,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 02:08:54,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 02:08:54,885 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 02:08:54,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 02:08:54,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 02:08:54,888 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 02:08:54,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 02:08:54,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 02:08:54,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 02:08:54,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 02:08:54,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 02:08:54,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 02:08:54,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 02:08:54,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 02:08:54,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 02:08:54,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 02:08:54,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 02:08:54,904 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 02:08:54,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 02:08:54,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:08:54,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 02:08:54,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 02:08:54,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 02:08:54,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 02:08:54,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 02:08:54,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 02:08:54,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 02:08:54,920 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/UAutomizer-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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 02:08:55,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 02:08:55,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 02:08:55,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 02:08:55,086 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 02:08:55,086 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 02:08:55,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2023-11-30 02:08:56,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 02:08:56,202 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 02:08:56,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2023-11-30 02:08:56,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9629d6b69/99da86ff14fc4e8f9e002cefda67025f/FLAGb83a0f5d7 [2023-11-30 02:08:56,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9629d6b69/99da86ff14fc4e8f9e002cefda67025f [2023-11-30 02:08:56,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 02:08:56,226 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 02:08:56,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 02:08:56,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 02:08:56,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 02:08:56,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5440ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56, skipping insertion in model container [2023-11-30 02:08:56,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,264 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 02:08:56,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:08:56,598 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 02:08:56,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:08:56,677 WARN L675 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 02:08:56,682 INFO L206 MainTranslator]: Completed translation [2023-11-30 02:08:56,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56 WrapperNode [2023-11-30 02:08:56,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 02:08:56,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 02:08:56,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 02:08:56,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 02:08:56,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,741 INFO L138 Inliner]: procedures = 355, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2023-11-30 02:08:56,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 02:08:56,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 02:08:56,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 02:08:56,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 02:08:56,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 02:08:56,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 02:08:56,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 02:08:56,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 02:08:56,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (1/1) ... [2023-11-30 02:08:56,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:08:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:08:56,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 02:08:56,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 02:08:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-11-30 02:08:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-11-30 02:08:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 02:08:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 02:08:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 02:08:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 02:08:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 02:08:56,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 02:08:56,828 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 02:08:57,011 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 02:08:57,013 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 02:08:57,180 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 02:08:57,196 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 02:08:57,196 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 02:08:57,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:08:57 BoogieIcfgContainer [2023-11-30 02:08:57,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 02:08:57,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 02:08:57,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 02:08:57,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 02:08:57,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:08:56" (1/3) ... [2023-11-30 02:08:57,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dba0556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:08:57, skipping insertion in model container [2023-11-30 02:08:57,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:08:56" (2/3) ... [2023-11-30 02:08:57,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dba0556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:08:57, skipping insertion in model container [2023-11-30 02:08:57,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:08:57" (3/3) ... [2023-11-30 02:08:57,203 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_true.i [2023-11-30 02:08:57,214 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 02:08:57,214 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-30 02:08:57,215 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 02:08:57,254 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 02:08:57,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 130 transitions, 274 flow [2023-11-30 02:08:57,315 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-30 02:08:57,315 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 02:08:57,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 128 events. 2/128 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-30 02:08:57,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 130 transitions, 274 flow [2023-11-30 02:08:57,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 117 transitions, 243 flow [2023-11-30 02:08:57,338 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 02:08:57,342 INFO L362 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=PETRI_NET, 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;@5b87b634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 02:08:57,342 INFO L363 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-30 02:08:57,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 02:08:57,364 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2023-11-30 02:08:57,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 02:08:57,364 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:08:57,365 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:08:57,365 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 11 more)] === [2023-11-30 02:08:57,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:08:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash 540575035, now seen corresponding path program 1 times [2023-11-30 02:08:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:08:57,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873385197] [2023-11-30 02:08:57,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:08:57,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:08:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:08:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:08:57,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:08:57,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873385197] [2023-11-30 02:08:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873385197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:08:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:08:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:08:57,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171356511] [2023-11-30 02:08:57,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:08:57,622 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:08:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:08:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:08:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:08:57,660 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 130 [2023-11-30 02:08:57,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2023-11-30 02:08:57,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:08:57,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 130 [2023-11-30 02:08:57,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:08:57,828 INFO L124 PetriNetUnfolderBase]: 116/529 cut-off events. [2023-11-30 02:08:57,828 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-30 02:08:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 529 events. 116/529 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2598 event pairs, 82 based on Foata normal form. 8/464 useless extension candidates. Maximal degree in co-relation 720. Up to 233 conditions per place. [2023-11-30 02:08:57,836 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 30 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2023-11-30 02:08:57,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 320 flow [2023-11-30 02:08:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:08:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:08:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-11-30 02:08:57,850 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8641025641025641 [2023-11-30 02:08:57,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-11-30 02:08:57,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-11-30 02:08:57,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:08:57,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-11-30 02:08:57,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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) [2023-11-30 02:08:57,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:57,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:57,861 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2023-11-30 02:08:57,862 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 120 transitions, 320 flow [2023-11-30 02:08:57,862 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2023-11-30 02:08:57,862 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:08:57,862 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:08:57,862 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 02:08:57,863 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 11 more)] === [2023-11-30 02:08:57,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:08:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash -539823950, now seen corresponding path program 1 times [2023-11-30 02:08:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:08:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907046638] [2023-11-30 02:08:57,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:08:57,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:08:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:08:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:08:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:08:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907046638] [2023-11-30 02:08:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907046638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:08:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:08:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:08:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131150685] [2023-11-30 02:08:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:08:57,956 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:08:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:08:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:08:57,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:08:57,958 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 130 [2023-11-30 02:08:57,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 120 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2023-11-30 02:08:57,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:08:57,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 130 [2023-11-30 02:08:57,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:08:58,056 INFO L124 PetriNetUnfolderBase]: 122/579 cut-off events. [2023-11-30 02:08:58,056 INFO L125 PetriNetUnfolderBase]: For 128/181 co-relation queries the response was YES. [2023-11-30 02:08:58,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 579 events. 122/579 cut-off events. For 128/181 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2946 event pairs, 58 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 1028. Up to 249 conditions per place. [2023-11-30 02:08:58,060 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 35 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2023-11-30 02:08:58,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 130 transitions, 445 flow [2023-11-30 02:08:58,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:08:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:08:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-11-30 02:08:58,064 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8769230769230769 [2023-11-30 02:08:58,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-11-30 02:08:58,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-11-30 02:08:58,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:08:58,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-11-30 02:08:58,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-11-30 02:08:58,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:58,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:58,069 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2023-11-30 02:08:58,069 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 130 transitions, 445 flow [2023-11-30 02:08:58,069 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2023-11-30 02:08:58,069 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:08:58,070 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:08:58,070 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 02:08:58,070 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 11 more)] === [2023-11-30 02:08:58,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:08:58,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1161215536, now seen corresponding path program 1 times [2023-11-30 02:08:58,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:08:58,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273368590] [2023-11-30 02:08:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:08:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:08:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:08:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:08:58,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:08:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273368590] [2023-11-30 02:08:58,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273368590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:08:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:08:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:08:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682045936] [2023-11-30 02:08:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:08:58,174 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:08:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:08:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:08:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:08:58,177 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 130 [2023-11-30 02:08:58,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 130 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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) [2023-11-30 02:08:58,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:08:58,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 130 [2023-11-30 02:08:58,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:08:58,302 INFO L124 PetriNetUnfolderBase]: 170/739 cut-off events. [2023-11-30 02:08:58,302 INFO L125 PetriNetUnfolderBase]: For 390/503 co-relation queries the response was YES. [2023-11-30 02:08:58,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 739 events. 170/739 cut-off events. For 390/503 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3974 event pairs, 55 based on Foata normal form. 3/669 useless extension candidates. Maximal degree in co-relation 1588. Up to 293 conditions per place. [2023-11-30 02:08:58,308 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 56 selfloop transitions, 13 changer transitions 0/156 dead transitions. [2023-11-30 02:08:58,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 156 transitions, 738 flow [2023-11-30 02:08:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:08:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:08:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-11-30 02:08:58,309 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8871794871794871 [2023-11-30 02:08:58,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-11-30 02:08:58,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-11-30 02:08:58,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:08:58,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-11-30 02:08:58,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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) [2023-11-30 02:08:58,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:58,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:58,313 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 3 predicate places. [2023-11-30 02:08:58,313 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 156 transitions, 738 flow [2023-11-30 02:08:58,313 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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) [2023-11-30 02:08:58,313 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:08:58,313 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:08:58,313 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 02:08:58,313 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 11 more)] === [2023-11-30 02:08:58,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:08:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1556577588, now seen corresponding path program 1 times [2023-11-30 02:08:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:08:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691707855] [2023-11-30 02:08:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:08:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:08:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:08:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:08:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:08:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691707855] [2023-11-30 02:08:58,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691707855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:08:58,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:08:58,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:08:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151078729] [2023-11-30 02:08:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:08:58,714 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:08:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:08:58,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:08:58,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:08:58,716 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 130 [2023-11-30 02:08:58,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 156 transitions, 738 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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) [2023-11-30 02:08:58,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:08:58,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 130 [2023-11-30 02:08:58,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:08:58,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][149], [146#true, 140#(= |f1Thread1of1ForFork0_#t~nondet5#1| |#race~g~0|), 154#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), f2Thread1of1ForFork1InUse, f1Thread1of1ForFork0InUse, 13#L1378-4true, 103#L1356-3true, 109#L1368-3true, 142#true]) [2023-11-30 02:08:58,926 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is not cut-off event [2023-11-30 02:08:58,926 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is not cut-off event [2023-11-30 02:08:58,927 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is not cut-off event [2023-11-30 02:08:58,927 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is not cut-off event [2023-11-30 02:08:58,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][152], [146#true, 111#L1378-5true, 140#(= |f1Thread1of1ForFork0_#t~nondet5#1| |#race~g~0|), f2Thread1of1ForFork1InUse, f1Thread1of1ForFork0InUse, 103#L1356-3true, 109#L1368-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:58,927 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2023-11-30 02:08:58,927 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-30 02:08:58,927 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-30 02:08:58,927 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-30 02:08:58,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][152], [146#true, 140#(= |f1Thread1of1ForFork0_#t~nondet5#1| |#race~g~0|), f2Thread1of1ForFork1InUse, f1Thread1of1ForFork0InUse, 6#L1378-6true, 103#L1356-3true, 109#L1368-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:58,940 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2023-11-30 02:08:58,940 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 02:08:58,940 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 02:08:58,940 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 02:08:59,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][110], [146#true, 154#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 11#f1Err3ASSERT_VIOLATIONDATA_RACEtrue, 13#L1378-4true, 109#L1368-3true, 142#true]) [2023-11-30 02:08:59,084 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,084 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,084 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,084 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][113], [146#true, 111#L1378-5true, f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 11#f1Err3ASSERT_VIOLATIONDATA_RACEtrue, 109#L1368-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,084 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,084 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,084 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,084 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][110], [146#true, 51#L1360-4true, 154#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 13#L1378-4true, 109#L1368-3true, 142#true]) [2023-11-30 02:08:59,085 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,085 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,085 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,085 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][113], [146#true, 111#L1378-5true, 51#L1360-4true, f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 109#L1368-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,085 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,085 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,085 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,085 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L1361-->L1361-3: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_f1Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, f1Thread1of1ForFork0_#t~nondet10#1=|v_f1Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet10#1][197], [154#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 102#L1361-3true, 148#(= |f2Thread1of1ForFork1_#t~nondet12| |#race~g~0|), 13#L1378-4true, 93#L1366-4true, 142#true]) [2023-11-30 02:08:59,086 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,086 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,086 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,086 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 02:08:59,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L1361-->L1361-3: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_f1Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, f1Thread1of1ForFork0_#t~nondet10#1=|v_f1Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet10#1][200], [111#L1378-5true, f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 102#L1361-3true, 148#(= |f2Thread1of1ForFork1_#t~nondet12| |#race~g~0|), 93#L1366-4true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,086 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,086 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,086 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,086 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L1361-->L1361-3: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_f1Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, f1Thread1of1ForFork0_#t~nondet10#1=|v_f1Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet10#1][190], [5#L1368true, 146#true, 154#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 102#L1361-3true, 13#L1378-4true, 142#true]) [2023-11-30 02:08:59,089 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,089 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,089 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,089 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 02:08:59,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][113], [146#true, f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 6#L1378-6true, 11#f1Err3ASSERT_VIOLATIONDATA_RACEtrue, 109#L1368-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,090 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,090 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,090 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,090 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([344] L1368-->L1368-3: Formula: (and (= |v_#pthreadsMutex_49| (store |v_#pthreadsMutex_50| |v_~#mut~0.base_31| (store (select |v_#pthreadsMutex_50| |v_~#mut~0.base_31|) |v_~#mut~0.offset_31| 0))) (= |v_f2Thread1of1ForFork1_#t~nondet13_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_31|, #pthreadsMutex=|v_#pthreadsMutex_50|, ~#mut~0.base=|v_~#mut~0.base_31|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_31|, f2Thread1of1ForFork1_#t~nondet13=|v_f2Thread1of1ForFork1_#t~nondet13_1|, #pthreadsMutex=|v_#pthreadsMutex_49|, ~#mut~0.base=|v_~#mut~0.base_31|} AuxVars[] AssignedVars[#pthreadsMutex, f2Thread1of1ForFork1_#t~nondet13][113], [146#true, 51#L1360-4true, f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 6#L1378-6true, 109#L1368-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,090 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,090 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,090 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,091 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L1361-->L1361-3: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_f1Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, f1Thread1of1ForFork0_#t~nondet10#1=|v_f1Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet10#1][200], [f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 6#L1378-6true, 102#L1361-3true, 148#(= |f2Thread1of1ForFork1_#t~nondet12| |#race~g~0|), 93#L1366-4true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,091 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,091 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,091 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,091 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L1361-->L1361-3: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_f1Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, f1Thread1of1ForFork0_#t~nondet10#1=|v_f1Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet10#1][193], [146#true, 5#L1368true, 111#L1378-5true, f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 102#L1361-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,092 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,092 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,092 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,092 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 02:08:59,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L1361-->L1361-3: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_f1Thread1of1ForFork0_#t~nondet10#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, f1Thread1of1ForFork0_#t~nondet10#1=|v_f1Thread1of1ForFork0_#t~nondet10#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, f1Thread1of1ForFork0_#t~nondet10#1][193], [146#true, 5#L1368true, f2Thread1of1ForFork1InUse, 138#true, f1Thread1of1ForFork0InUse, 6#L1378-6true, 102#L1361-3true, 155#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 142#true]) [2023-11-30 02:08:59,096 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-30 02:08:59,096 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 02:08:59,096 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 02:08:59,096 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 02:08:59,117 INFO L124 PetriNetUnfolderBase]: 1268/3088 cut-off events. [2023-11-30 02:08:59,119 INFO L125 PetriNetUnfolderBase]: For 3958/4769 co-relation queries the response was YES. [2023-11-30 02:08:59,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9623 conditions, 3088 events. 1268/3088 cut-off events. For 3958/4769 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 23357 event pairs, 236 based on Foata normal form. 11/2762 useless extension candidates. Maximal degree in co-relation 9374. Up to 1551 conditions per place. [2023-11-30 02:08:59,141 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 87 selfloop transitions, 4 changer transitions 0/211 dead transitions. [2023-11-30 02:08:59,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 211 transitions, 1366 flow [2023-11-30 02:08:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:08:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:08:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions. [2023-11-30 02:08:59,146 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2023-11-30 02:08:59,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 637 transitions. [2023-11-30 02:08:59,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions. [2023-11-30 02:08:59,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:08:59,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions. [2023-11-30 02:08:59,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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) [2023-11-30 02:08:59,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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) [2023-11-30 02:08:59,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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) [2023-11-30 02:08:59,151 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 7 predicate places. [2023-11-30 02:08:59,151 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 211 transitions, 1366 flow [2023-11-30 02:08:59,152 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 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) [2023-11-30 02:08:59,152 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:08:59,152 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:08:59,152 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 02:08:59,152 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 11 more)] === [2023-11-30 02:08:59,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:08:59,155 INFO L85 PathProgramCache]: Analyzing trace with hash 850345671, now seen corresponding path program 1 times [2023-11-30 02:08:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:08:59,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073785366] [2023-11-30 02:08:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:08:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:08:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:08:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:08:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:08:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073785366] [2023-11-30 02:08:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073785366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:08:59,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:08:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 02:08:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008667702] [2023-11-30 02:08:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:08:59,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:08:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:08:59,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:08:59,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:08:59,236 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 130 [2023-11-30 02:08:59,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 211 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2023-11-30 02:08:59,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:08:59,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 130 [2023-11-30 02:08:59,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:08:59,298 INFO L124 PetriNetUnfolderBase]: 119/490 cut-off events. [2023-11-30 02:08:59,298 INFO L125 PetriNetUnfolderBase]: For 2442/2651 co-relation queries the response was YES. [2023-11-30 02:08:59,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 490 events. 119/490 cut-off events. For 2442/2651 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2384 event pairs, 20 based on Foata normal form. 140/601 useless extension candidates. Maximal degree in co-relation 1300. Up to 198 conditions per place. [2023-11-30 02:08:59,301 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 14 selfloop transitions, 30 changer transitions 1/136 dead transitions. [2023-11-30 02:08:59,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 792 flow [2023-11-30 02:08:59,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:08:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:08:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 02:08:59,303 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9051282051282051 [2023-11-30 02:08:59,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 02:08:59,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 02:08:59,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:08:59,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 02:08:59,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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) [2023-11-30 02:08:59,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:59,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:59,307 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 5 predicate places. [2023-11-30 02:08:59,307 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 136 transitions, 792 flow [2023-11-30 02:08:59,307 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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) [2023-11-30 02:08:59,307 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:08:59,307 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:08:59,308 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 02:08:59,308 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 11 more)] === [2023-11-30 02:08:59,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:08:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 722522826, now seen corresponding path program 1 times [2023-11-30 02:08:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:08:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098391718] [2023-11-30 02:08:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:08:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:08:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:08:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:08:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:08:59,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098391718] [2023-11-30 02:08:59,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098391718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:08:59,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:08:59,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:08:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33520993] [2023-11-30 02:08:59,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:08:59,375 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:08:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:08:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:08:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:08:59,377 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 130 [2023-11-30 02:08:59,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 136 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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) [2023-11-30 02:08:59,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:08:59,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 130 [2023-11-30 02:08:59,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:08:59,433 INFO L124 PetriNetUnfolderBase]: 121/433 cut-off events. [2023-11-30 02:08:59,434 INFO L125 PetriNetUnfolderBase]: For 2014/2281 co-relation queries the response was YES. [2023-11-30 02:08:59,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 433 events. 121/433 cut-off events. For 2014/2281 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2066 event pairs, 17 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 1345. Up to 177 conditions per place. [2023-11-30 02:08:59,436 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 49 selfloop transitions, 2 changer transitions 1/136 dead transitions. [2023-11-30 02:08:59,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 901 flow [2023-11-30 02:08:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:08:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:08:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-30 02:08:59,437 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8282051282051283 [2023-11-30 02:08:59,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-30 02:08:59,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-30 02:08:59,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:08:59,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-30 02:08:59,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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) [2023-11-30 02:08:59,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:59,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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) [2023-11-30 02:08:59,442 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 6 predicate places. [2023-11-30 02:08:59,442 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 136 transitions, 901 flow [2023-11-30 02:08:59,442 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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) [2023-11-30 02:08:59,442 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:08:59,442 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:08:59,442 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 02:08:59,442 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 11 more)] === [2023-11-30 02:08:59,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:08:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash -546038120, now seen corresponding path program 1 times [2023-11-30 02:08:59,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:08:59,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386557148] [2023-11-30 02:08:59,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:08:59,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:08:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:08:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:08:59,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:08:59,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386557148] [2023-11-30 02:08:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386557148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:08:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:08:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:08:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571171036] [2023-11-30 02:08:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:08:59,871 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:08:59,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:08:59,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:08:59,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:08:59,873 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 130 [2023-11-30 02:08:59,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 136 transitions, 901 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-30 02:08:59,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:08:59,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 130 [2023-11-30 02:08:59,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:08:59,978 INFO L124 PetriNetUnfolderBase]: 124/534 cut-off events. [2023-11-30 02:08:59,978 INFO L125 PetriNetUnfolderBase]: For 2670/2933 co-relation queries the response was YES. [2023-11-30 02:08:59,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 534 events. 124/534 cut-off events. For 2670/2933 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2508 event pairs, 24 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 1766. Up to 212 conditions per place. [2023-11-30 02:08:59,980 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 0 selfloop transitions, 0 changer transitions 143/143 dead transitions. [2023-11-30 02:08:59,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 143 transitions, 1131 flow [2023-11-30 02:08:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:08:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:08:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2023-11-30 02:08:59,981 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7948717948717948 [2023-11-30 02:08:59,981 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 620 transitions. [2023-11-30 02:08:59,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 620 transitions. [2023-11-30 02:08:59,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:08:59,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 620 transitions. [2023-11-30 02:08:59,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 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) [2023-11-30 02:08:59,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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) [2023-11-30 02:08:59,985 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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) [2023-11-30 02:08:59,986 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2023-11-30 02:08:59,986 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 143 transitions, 1131 flow [2023-11-30 02:08:59,986 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-30 02:08:59,991 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_67-pthread_cond_wait_true.i_BEv2_AllErrorsAtOnce [2023-11-30 02:09:00,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2023-11-30 02:09:00,020 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-11-30 02:09:00,021 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-11-30 02:09:00,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-11-30 02:09:00,022 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f1Err3ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-11-30 02:09:00,023 INFO L810 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-11-30 02:09:00,023 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 02:09:00,023 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:09:00,027 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 02:09:00,027 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 02:09:00,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:09:00 BasicIcfg [2023-11-30 02:09:00,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 02:09:00,034 INFO L158 Benchmark]: Toolchain (without parser) took 3807.85ms. Allocated memory is still 564.1MB. Free memory was 521.4MB in the beginning and 381.5MB in the end (delta: 139.9MB). Peak memory consumption was 141.5MB. Max. memory is 16.0GB. [2023-11-30 02:09:00,034 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 329.3MB. Free memory is still 280.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 02:09:00,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.63ms. Allocated memory is still 564.1MB. Free memory was 521.0MB in the beginning and 482.3MB in the end (delta: 38.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-11-30 02:09:00,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.10ms. Allocated memory is still 564.1MB. Free memory was 482.3MB in the beginning and 479.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:09:00,034 INFO L158 Benchmark]: Boogie Preprocessor took 30.92ms. Allocated memory is still 564.1MB. Free memory was 479.4MB in the beginning and 476.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:09:00,035 INFO L158 Benchmark]: RCFGBuilder took 424.63ms. Allocated memory is still 564.1MB. Free memory was 476.8MB in the beginning and 513.1MB in the end (delta: -36.4MB). Peak memory consumption was 21.3MB. Max. memory is 16.0GB. [2023-11-30 02:09:00,035 INFO L158 Benchmark]: TraceAbstraction took 2834.52ms. Allocated memory is still 564.1MB. Free memory was 513.1MB in the beginning and 381.5MB in the end (delta: 131.7MB). Peak memory consumption was 130.6MB. Max. memory is 16.0GB. [2023-11-30 02:09:00,037 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.11ms. Allocated memory is still 329.3MB. Free memory is still 280.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 455.63ms. Allocated memory is still 564.1MB. Free memory was 521.0MB in the beginning and 482.3MB in the end (delta: 38.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.10ms. Allocated memory is still 564.1MB. Free memory was 482.3MB in the beginning and 479.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.92ms. Allocated memory is still 564.1MB. Free memory was 479.4MB in the beginning and 476.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 424.63ms. Allocated memory is still 564.1MB. Free memory was 476.8MB in the beginning and 513.1MB in the end (delta: -36.4MB). Peak memory consumption was 21.3MB. Max. memory is 16.0GB. * TraceAbstraction took 2834.52ms. Allocated memory is still 564.1MB. Free memory was 513.1MB in the beginning and 381.5MB in the end (delta: 131.7MB). Peak memory consumption was 130.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1378]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1379]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1356]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1358]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1359]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1360]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1366]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 188 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 80 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1366occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 02:09:00,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...