./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:45:25,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:45:25,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:45:25,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:45:25,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:45:26,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:45:26,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:45:26,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:45:26,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:45:26,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:45:26,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:45:26,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:45:26,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:45:26,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:45:26,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:45:26,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:45:26,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:45:26,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:45:26,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:45:26,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:45:26,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:45:26,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:45:26,029 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:45:26,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:45:26,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:45:26,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:45:26,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:45:26,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:45:26,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:45:26,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:45:26,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:45:26,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:45:26,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:45:26,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:45:26,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:45:26,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:45:26,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:45:26,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:45:26,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:45:26,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:45:26,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:45:26,033 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2024-11-12 12:45:26,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:45:26,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:45:26,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:45:26,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:45:26,252 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:45:26,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-12 12:45:27,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:45:27,670 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:45:27,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-12 12:45:27,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88325394/04f0f76a754d49ed94065b4c4809a51f/FLAG3ded13003 [2024-11-12 12:45:27,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88325394/04f0f76a754d49ed94065b4c4809a51f [2024-11-12 12:45:27,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:45:27,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:45:27,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:45:27,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:45:27,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:45:27,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:27" (1/1) ... [2024-11-12 12:45:27,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@976c5cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:27, skipping insertion in model container [2024-11-12 12:45:27,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:27" (1/1) ... [2024-11-12 12:45:27,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:45:28,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:45:28,047 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:45:28,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:45:28,105 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:45:28,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28 WrapperNode [2024-11-12 12:45:28,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:45:28,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:45:28,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:45:28,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:45:28,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,145 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-12 12:45:28,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:45:28,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:45:28,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:45:28,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:45:28,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:45:28,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:45:28,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:45:28,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:45:28,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (1/1) ... [2024-11-12 12:45:28,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:45:28,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:45:28,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:45:28,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:45:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:45:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:45:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:45:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-12 12:45:28,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-12 12:45:28,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:45:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:45:28,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:45:28,252 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:45:28,350 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:45:28,352 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:45:28,613 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:45:28,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:45:28,650 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:45:28,650 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 12:45:28,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:28 BoogieIcfgContainer [2024-11-12 12:45:28,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:45:28,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:45:28,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:45:28,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:45:28,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:45:27" (1/3) ... [2024-11-12 12:45:28,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28af3eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:28, skipping insertion in model container [2024-11-12 12:45:28,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:28" (2/3) ... [2024-11-12 12:45:28,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28af3eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:28, skipping insertion in model container [2024-11-12 12:45:28,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:28" (3/3) ... [2024-11-12 12:45:28,656 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2024-11-12 12:45:28,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:45:28,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-12 12:45:28,671 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:45:28,725 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 12:45:28,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 232 transitions, 468 flow [2024-11-12 12:45:28,837 INFO L124 PetriNetUnfolderBase]: 7/274 cut-off events. [2024-11-12 12:45:28,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:45:28,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 7/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-12 12:45:28,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 232 transitions, 468 flow [2024-11-12 12:45:28,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 232 transitions, 468 flow [2024-11-12 12:45:28,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:45:28,863 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@674c3d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:45:28,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-12 12:45:28,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:45:28,900 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-12 12:45:28,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:45:28,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:28,901 INFO L206 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, 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] [2024-11-12 12:45:28,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:45:28,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1558289720, now seen corresponding path program 1 times [2024-11-12 12:45:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822462094] [2024-11-12 12:45:28,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:29,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:29,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822462094] [2024-11-12 12:45:29,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822462094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:29,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:29,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946088647] [2024-11-12 12:45:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:29,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:29,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-12 12:45:29,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:29,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:29,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-12 12:45:29,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:29,580 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2024-11-12 12:45:29,580 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:45:29,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3162 event pairs, 33 based on Foata normal form. 9/637 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2024-11-12 12:45:29,590 INFO L140 encePairwiseOnDemand]: 218/232 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2024-11-12 12:45:29,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2024-11-12 12:45:29,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-12 12:45:29,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9612068965517241 [2024-11-12 12:45:29,608 INFO L175 Difference]: Start difference. First operand has 231 places, 232 transitions, 468 flow. Second operand 3 states and 669 transitions. [2024-11-12 12:45:29,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2024-11-12 12:45:29,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:45:29,618 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2024-11-12 12:45:29,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-11-12 12:45:29,624 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-12 12:45:29,625 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2024-11-12 12:45:29,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:29,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:29,626 INFO L206 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, 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] [2024-11-12 12:45:29,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:45:29,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:45:29,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -393361375, now seen corresponding path program 1 times [2024-11-12 12:45:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:29,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599651275] [2024-11-12 12:45:29,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:29,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:29,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599651275] [2024-11-12 12:45:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599651275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:29,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:29,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:29,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65670322] [2024-11-12 12:45:29,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:29,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:29,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-12 12:45:29,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:29,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:29,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-12 12:45:29,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:29,904 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2024-11-12 12:45:29,905 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2024-11-12 12:45:29,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4213 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2024-11-12 12:45:29,907 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2024-11-12 12:45:29,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2024-11-12 12:45:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-11-12 12:45:29,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9367816091954023 [2024-11-12 12:45:29,909 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2024-11-12 12:45:29,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2024-11-12 12:45:29,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:29,916 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2024-11-12 12:45:29,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2024-11-12 12:45:29,918 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-12 12:45:29,918 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2024-11-12 12:45:29,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:29,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:29,919 INFO L206 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, 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] [2024-11-12 12:45:29,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:45:29,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:45:29,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1871831431, now seen corresponding path program 1 times [2024-11-12 12:45:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892089206] [2024-11-12 12:45:29,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892089206] [2024-11-12 12:45:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892089206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:30,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:30,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:30,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628188689] [2024-11-12 12:45:30,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:30,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:30,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:30,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 232 [2024-11-12 12:45:30,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:30,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:30,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 232 [2024-11-12 12:45:30,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:30,115 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2024-11-12 12:45:30,115 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2024-11-12 12:45:30,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3732 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2024-11-12 12:45:30,120 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2024-11-12 12:45:30,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2024-11-12 12:45:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-12 12:45:30,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2024-11-12 12:45:30,122 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2024-11-12 12:45:30,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2024-11-12 12:45:30,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:30,127 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2024-11-12 12:45:30,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-12 12:45:30,129 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2024-11-12 12:45:30,129 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2024-11-12 12:45:30,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:30,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:30,130 INFO L206 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, 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] [2024-11-12 12:45:30,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:45:30,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:45:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2000284448, now seen corresponding path program 1 times [2024-11-12 12:45:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540866953] [2024-11-12 12:45:30,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540866953] [2024-11-12 12:45:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540866953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411207752] [2024-11-12 12:45:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:30,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:30,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:30,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:30,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232 [2024-11-12 12:45:30,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:30,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:30,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232 [2024-11-12 12:45:30,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:30,334 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2024-11-12 12:45:30,334 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-12 12:45:30,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3947 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2024-11-12 12:45:30,336 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2024-11-12 12:45:30,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2024-11-12 12:45:30,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-12 12:45:30,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525862068965517 [2024-11-12 12:45:30,338 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2024-11-12 12:45:30,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2024-11-12 12:45:30,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:30,344 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2024-11-12 12:45:30,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2024-11-12 12:45:30,345 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2024-11-12 12:45:30,345 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2024-11-12 12:45:30,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:30,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:30,346 INFO L206 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:45:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:45:30,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:45:30,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:30,347 INFO L85 PathProgramCache]: Analyzing trace with hash 319446888, now seen corresponding path program 1 times [2024-11-12 12:45:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253129994] [2024-11-12 12:45:30,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253129994] [2024-11-12 12:45:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253129994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:30,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:30,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374763091] [2024-11-12 12:45:30,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:30,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:30,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:30,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232 [2024-11-12 12:45:30,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:30,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:30,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232 [2024-11-12 12:45:30,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:30,547 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2024-11-12 12:45:30,547 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2024-11-12 12:45:30,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5124 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2024-11-12 12:45:30,551 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2024-11-12 12:45:30,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2024-11-12 12:45:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2024-11-12 12:45:30,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468390804597702 [2024-11-12 12:45:30,553 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2024-11-12 12:45:30,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2024-11-12 12:45:30,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:30,558 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2024-11-12 12:45:30,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2024-11-12 12:45:30,560 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-12 12:45:30,561 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2024-11-12 12:45:30,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:30,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:30,563 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-12 12:45:30,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:45:30,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-12 12:45:30,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2093932926, now seen corresponding path program 1 times [2024-11-12 12:45:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368454440] [2024-11-12 12:45:30,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:45:30,618 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:45:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:45:30,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:45:30,677 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:45:30,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-12 12:45:30,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-12 12:45:30,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-12 12:45:30,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-12 12:45:30,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-12 12:45:30,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-12 12:45:30,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-12 12:45:30,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-12 12:45:30,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-12 12:45:30,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-12 12:45:30,686 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-12 12:45:30,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:45:30,686 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 12:45:30,688 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:45:30,688 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 12:45:30,706 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 12:45:30,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 534 flow [2024-11-12 12:45:30,734 INFO L124 PetriNetUnfolderBase]: 10/354 cut-off events. [2024-11-12 12:45:30,735 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:45:30,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 354 events. 10/354 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2024-11-12 12:45:30,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 534 flow [2024-11-12 12:45:30,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 534 flow [2024-11-12 12:45:30,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:45:30,739 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@674c3d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:45:30,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-12 12:45:30,747 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:45:30,747 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-12 12:45:30,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:45:30,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:30,748 INFO L206 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, 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] [2024-11-12 12:45:30,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:30,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1014442248, now seen corresponding path program 1 times [2024-11-12 12:45:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:30,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086827620] [2024-11-12 12:45:30,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086827620] [2024-11-12 12:45:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086827620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341673959] [2024-11-12 12:45:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:30,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:30,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 262 [2024-11-12 12:45:30,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:30,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:30,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 262 [2024-11-12 12:45:30,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:31,610 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2024-11-12 12:45:31,610 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-12 12:45:31,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 63917 event pairs, 879 based on Foata normal form. 92/6148 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2024-11-12 12:45:31,641 INFO L140 encePairwiseOnDemand]: 244/262 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2024-11-12 12:45:31,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2024-11-12 12:45:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-12 12:45:31,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428 [2024-11-12 12:45:31,644 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 534 flow. Second operand 3 states and 750 transitions. [2024-11-12 12:45:31,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2024-11-12 12:45:31,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:45:31,648 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2024-11-12 12:45:31,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2024-11-12 12:45:31,650 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2024-11-12 12:45:31,650 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2024-11-12 12:45:31,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:31,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:31,651 INFO L206 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, 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] [2024-11-12 12:45:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:45:31,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 755746279, now seen corresponding path program 1 times [2024-11-12 12:45:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204929891] [2024-11-12 12:45:31,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:31,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:31,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204929891] [2024-11-12 12:45:31,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204929891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:31,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:31,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:31,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933431081] [2024-11-12 12:45:31,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:31,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:31,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:31,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:31,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:31,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 262 [2024-11-12 12:45:31,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:31,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:31,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 262 [2024-11-12 12:45:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:32,713 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2024-11-12 12:45:32,714 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES. [2024-11-12 12:45:32,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2807/3012 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 88093 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2024-11-12 12:45:32,759 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2024-11-12 12:45:32,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2024-11-12 12:45:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2024-11-12 12:45:32,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338422391857506 [2024-11-12 12:45:32,814 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2024-11-12 12:45:32,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2024-11-12 12:45:32,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:32,823 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2024-11-12 12:45:32,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2024-11-12 12:45:32,824 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-12 12:45:32,825 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2024-11-12 12:45:32,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:32,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:32,826 INFO L206 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, 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] [2024-11-12 12:45:32,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:45:32,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:32,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash -609232263, now seen corresponding path program 1 times [2024-11-12 12:45:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367592863] [2024-11-12 12:45:32,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:32,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:32,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367592863] [2024-11-12 12:45:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367592863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:32,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729810469] [2024-11-12 12:45:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:32,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 262 [2024-11-12 12:45:32,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:32,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:32,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 262 [2024-11-12 12:45:32,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:33,760 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2024-11-12 12:45:33,760 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES. [2024-11-12 12:45:33,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1101/1918 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 82748 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2024-11-12 12:45:33,805 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2024-11-12 12:45:33,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2024-11-12 12:45:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-12 12:45:33,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-12 12:45:33,808 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2024-11-12 12:45:33,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2024-11-12 12:45:33,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:33,818 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2024-11-12 12:45:33,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2024-11-12 12:45:33,820 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2024-11-12 12:45:33,820 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2024-11-12 12:45:33,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:33,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:33,821 INFO L206 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, 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] [2024-11-12 12:45:33,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:45:33,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:33,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1402832215, now seen corresponding path program 1 times [2024-11-12 12:45:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936449135] [2024-11-12 12:45:33,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:33,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936449135] [2024-11-12 12:45:33,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936449135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:33,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:33,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763751761] [2024-11-12 12:45:33,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:33,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:33,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:33,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-12 12:45:33,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:33,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:33,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-12 12:45:33,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:35,007 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2024-11-12 12:45:35,007 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2024-11-12 12:45:35,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 113160 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2024-11-12 12:45:35,049 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2024-11-12 12:45:35,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2024-11-12 12:45:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-12 12:45:35,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-12 12:45:35,051 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2024-11-12 12:45:35,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2024-11-12 12:45:35,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:35,061 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2024-11-12 12:45:35,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2024-11-12 12:45:35,063 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2024-11-12 12:45:35,063 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2024-11-12 12:45:35,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:35,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:35,064 INFO L206 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:45:35,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:45:35,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:35,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -434774543, now seen corresponding path program 1 times [2024-11-12 12:45:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:35,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386056570] [2024-11-12 12:45:35,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:35,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386056570] [2024-11-12 12:45:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386056570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:35,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:35,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622532782] [2024-11-12 12:45:35,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:35,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:35,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:35,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:35,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:35,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-12 12:45:35,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:35,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:35,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-12 12:45:35,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:36,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][270], [281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:36,557 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-12 12:45:36,557 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:36,557 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:36,557 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:36,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [281#true, 38#L697true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:36,646 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-12 12:45:36,646 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-12 12:45:36,647 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-12 12:45:36,647 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-12 12:45:36,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [260#L697-3true, 281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:36,681 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-12 12:45:36,681 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-12 12:45:36,681 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-12 12:45:36,681 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-12 12:45:36,801 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2024-11-12 12:45:36,801 INFO L125 PetriNetUnfolderBase]: For 5573/5897 co-relation queries the response was YES. [2024-11-12 12:45:36,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5573/5897 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 146600 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2024-11-12 12:45:36,864 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2024-11-12 12:45:36,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2024-11-12 12:45:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-12 12:45:36,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2024-11-12 12:45:36,867 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2024-11-12 12:45:36,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2024-11-12 12:45:36,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:36,875 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2024-11-12 12:45:36,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2024-11-12 12:45:36,876 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-12 12:45:36,877 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2024-11-12 12:45:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:36,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:36,877 INFO L206 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:45:36,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:45:36,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:36,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1143101991, now seen corresponding path program 1 times [2024-11-12 12:45:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623555076] [2024-11-12 12:45:36,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623555076] [2024-11-12 12:45:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623555076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:45:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705369576] [2024-11-12 12:45:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:45:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:45:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:45:37,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262 [2024-11-12 12:45:37,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:37,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:37,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262 [2024-11-12 12:45:37,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:38,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L705-5-->L705-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 271#true, 291#true, 61#L705-6true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 268#(= |#race~threads_alive~0| 0), 264#true]) [2024-11-12 12:45:38,283 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-12 12:45:38,283 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-12 12:45:38,283 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-12 12:45:38,283 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-12 12:45:38,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:38,307 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,307 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:38,307 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,307 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:38,363 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2024-11-12 12:45:38,363 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,363 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:38,363 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,363 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:38,363 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,369 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:38,370 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,370 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:38,370 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,370 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,370 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:38,370 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2024-11-12 12:45:38,419 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,419 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-12 12:45:38,419 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-12 12:45:38,419 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true, 197#L695-1true]) [2024-11-12 12:45:38,429 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-12 12:45:38,429 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-12 12:45:38,429 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-11-12 12:45:38,429 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-12 12:45:38,529 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:38,529 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,529 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-12 12:45:38,530 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,530 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-12 12:45:38,530 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [146#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:38,541 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,541 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-12 12:45:38,541 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,541 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-12 12:45:38,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L695-2-->L695-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2)) InVars {~threads_alive~0=v_~threads_alive~0_7} OutVars{~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][290], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 26#L695-3true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 238#L706-3true, 218#L695-3true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2024-11-12 12:45:38,546 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,546 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,546 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,547 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-12 12:45:38,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [260#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-12 12:45:38,588 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-12 12:45:38,589 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-12 12:45:38,589 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-12 12:45:38,589 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-12 12:45:38,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([809] L695-4-->L695-5: Formula: (= |v_#race~threads_alive~0_13| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][222], [Black: 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 28#L695-5true, 221#L695-2true, 234#L706true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 268#(= |#race~threads_alive~0| 0)]) [2024-11-12 12:45:38,599 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is not cut-off event [2024-11-12 12:45:38,599 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2024-11-12 12:45:38,599 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2024-11-12 12:45:38,599 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2024-11-12 12:45:39,032 INFO L124 PetriNetUnfolderBase]: 4737/15801 cut-off events. [2024-11-12 12:45:39,032 INFO L125 PetriNetUnfolderBase]: For 6564/7145 co-relation queries the response was YES. [2024-11-12 12:45:39,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 15801 events. 4737/15801 cut-off events. For 6564/7145 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 184989 event pairs, 1712 based on Foata normal form. 71/14046 useless extension candidates. Maximal degree in co-relation 16596. Up to 4209 conditions per place. [2024-11-12 12:45:39,128 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 45 selfloop transitions, 9 changer transitions 2/332 dead transitions. [2024-11-12 12:45:39,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 1100 flow [2024-11-12 12:45:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:45:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:45:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-12 12:45:39,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926208651399491 [2024-11-12 12:45:39,131 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 6 states and 1456 transitions. [2024-11-12 12:45:39,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 1100 flow [2024-11-12 12:45:39,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:39,162 INFO L231 Difference]: Finished difference. Result has 279 places, 309 transitions, 941 flow [2024-11-12 12:45:39,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=279, PETRI_TRANSITIONS=309} [2024-11-12 12:45:39,163 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 16 predicate places. [2024-11-12 12:45:39,163 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 309 transitions, 941 flow [2024-11-12 12:45:39,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:39,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:39,164 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:45:39,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:45:39,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:39,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1106641400, now seen corresponding path program 1 times [2024-11-12 12:45:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:39,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794051000] [2024-11-12 12:45:39,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:39,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:39,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794051000] [2024-11-12 12:45:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794051000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 12:45:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76117633] [2024-11-12 12:45:39,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:39,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:45:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:39,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:45:39,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:45:39,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-12 12:45:39,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 309 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:39,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:39,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-12 12:45:39,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:39,993 INFO L124 PetriNetUnfolderBase]: 321/2651 cut-off events. [2024-11-12 12:45:39,993 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2024-11-12 12:45:39,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2651 events. 321/2651 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 22692 event pairs, 119 based on Foata normal form. 86/2586 useless extension candidates. Maximal degree in co-relation 4104. Up to 283 conditions per place. [2024-11-12 12:45:40,000 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2024-11-12 12:45:40,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 762 flow [2024-11-12 12:45:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:45:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 12:45:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2024-11-12 12:45:40,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412213740458015 [2024-11-12 12:45:40,003 INFO L175 Difference]: Start difference. First operand has 279 places, 309 transitions, 941 flow. Second operand 5 states and 1233 transitions. [2024-11-12 12:45:40,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 762 flow [2024-11-12 12:45:40,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 716 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-11-12 12:45:40,010 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 679 flow [2024-11-12 12:45:40,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-11-12 12:45:40,011 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2024-11-12 12:45:40,011 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 679 flow [2024-11-12 12:45:40,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:40,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:40,012 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-12 12:45:40,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:45:40,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash 374705611, now seen corresponding path program 1 times [2024-11-12 12:45:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576578790] [2024-11-12 12:45:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576578790] [2024-11-12 12:45:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576578790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:40,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:40,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943434343] [2024-11-12 12:45:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:40,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:40,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:40,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-12 12:45:40,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:40,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:40,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-12 12:45:40,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:40,506 INFO L124 PetriNetUnfolderBase]: 1083/4561 cut-off events. [2024-11-12 12:45:40,507 INFO L125 PetriNetUnfolderBase]: For 1579/1591 co-relation queries the response was YES. [2024-11-12 12:45:40,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4561 events. 1083/4561 cut-off events. For 1579/1591 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 43860 event pairs, 573 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 8187. Up to 1492 conditions per place. [2024-11-12 12:45:40,532 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2024-11-12 12:45:40,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 286 transitions, 831 flow [2024-11-12 12:45:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-12 12:45:40,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2024-11-12 12:45:40,534 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 679 flow. Second operand 3 states and 746 transitions. [2024-11-12 12:45:40,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 286 transitions, 831 flow [2024-11-12 12:45:40,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 286 transitions, 810 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 12:45:40,541 INFO L231 Difference]: Finished difference. Result has 274 places, 276 transitions, 748 flow [2024-11-12 12:45:40,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=274, PETRI_TRANSITIONS=276} [2024-11-12 12:45:40,542 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-12 12:45:40,542 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 276 transitions, 748 flow [2024-11-12 12:45:40,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:40,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:40,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-12 12:45:40,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:45:40,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:40,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash 773386076, now seen corresponding path program 1 times [2024-11-12 12:45:40,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:40,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847404910] [2024-11-12 12:45:40,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:40,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:40,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847404910] [2024-11-12 12:45:40,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847404910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:40,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:40,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:45:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427697728] [2024-11-12 12:45:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:40,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:40,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:40,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 262 [2024-11-12 12:45:40,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:40,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:40,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 262 [2024-11-12 12:45:40,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:41,178 INFO L124 PetriNetUnfolderBase]: 646/4598 cut-off events. [2024-11-12 12:45:41,178 INFO L125 PetriNetUnfolderBase]: For 1809/1980 co-relation queries the response was YES. [2024-11-12 12:45:41,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 4598 events. 646/4598 cut-off events. For 1809/1980 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 48830 event pairs, 112 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 7189. Up to 698 conditions per place. [2024-11-12 12:45:41,199 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 21 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2024-11-12 12:45:41,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 849 flow [2024-11-12 12:45:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-12 12:45:41,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9643765903307888 [2024-11-12 12:45:41,201 INFO L175 Difference]: Start difference. First operand has 274 places, 276 transitions, 748 flow. Second operand 3 states and 758 transitions. [2024-11-12 12:45:41,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 849 flow [2024-11-12 12:45:41,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:45:41,208 INFO L231 Difference]: Finished difference. Result has 275 places, 283 transitions, 788 flow [2024-11-12 12:45:41,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=275, PETRI_TRANSITIONS=283} [2024-11-12 12:45:41,209 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2024-11-12 12:45:41,209 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 283 transitions, 788 flow [2024-11-12 12:45:41,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:41,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:41,210 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-12 12:45:41,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:45:41,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1258401358, now seen corresponding path program 2 times [2024-11-12 12:45:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098949203] [2024-11-12 12:45:41,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098949203] [2024-11-12 12:45:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098949203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 12:45:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771480398] [2024-11-12 12:45:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:41,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:45:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:45:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:45:41,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-12 12:45:41,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 283 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:41,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:41,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-12 12:45:41,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:41,822 INFO L124 PetriNetUnfolderBase]: 306/2803 cut-off events. [2024-11-12 12:45:41,822 INFO L125 PetriNetUnfolderBase]: For 1000/1210 co-relation queries the response was YES. [2024-11-12 12:45:41,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 2803 events. 306/2803 cut-off events. For 1000/1210 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 25167 event pairs, 75 based on Foata normal form. 65/2768 useless extension candidates. Maximal degree in co-relation 4473. Up to 328 conditions per place. [2024-11-12 12:45:41,834 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 28 selfloop transitions, 8 changer transitions 0/289 dead transitions. [2024-11-12 12:45:41,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 289 transitions, 867 flow [2024-11-12 12:45:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:45:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 12:45:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1236 transitions. [2024-11-12 12:45:41,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435114503816794 [2024-11-12 12:45:41,837 INFO L175 Difference]: Start difference. First operand has 275 places, 283 transitions, 788 flow. Second operand 5 states and 1236 transitions. [2024-11-12 12:45:41,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 289 transitions, 867 flow [2024-11-12 12:45:41,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 854 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-12 12:45:41,843 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 751 flow [2024-11-12 12:45:41,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2024-11-12 12:45:41,844 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2024-11-12 12:45:41,844 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 751 flow [2024-11-12 12:45:41,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:41,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:41,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-12 12:45:41,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:45:41,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:41,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1925231661, now seen corresponding path program 1 times [2024-11-12 12:45:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:41,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928109843] [2024-11-12 12:45:41,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:41,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928109843] [2024-11-12 12:45:41,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928109843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:41,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:41,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:41,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442986544] [2024-11-12 12:45:41,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:41,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:41,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:41,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:41,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-12 12:45:41,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:41,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:41,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-12 12:45:41,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:42,391 INFO L124 PetriNetUnfolderBase]: 503/3564 cut-off events. [2024-11-12 12:45:42,392 INFO L125 PetriNetUnfolderBase]: For 2170/2436 co-relation queries the response was YES. [2024-11-12 12:45:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 3564 events. 503/3564 cut-off events. For 2170/2436 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 34301 event pairs, 226 based on Foata normal form. 6/3415 useless extension candidates. Maximal degree in co-relation 6345. Up to 891 conditions per place. [2024-11-12 12:45:42,407 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 37 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-11-12 12:45:42,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 845 flow [2024-11-12 12:45:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-11-12 12:45:42,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223918575063613 [2024-11-12 12:45:42,409 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 751 flow. Second operand 3 states and 725 transitions. [2024-11-12 12:45:42,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 845 flow [2024-11-12 12:45:42,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 280 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 12:45:42,415 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 744 flow [2024-11-12 12:45:42,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2024-11-12 12:45:42,415 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2024-11-12 12:45:42,416 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 744 flow [2024-11-12 12:45:42,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:42,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:42,416 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-12 12:45:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:45:42,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-12 12:45:42,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash 608177901, now seen corresponding path program 1 times [2024-11-12 12:45:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772279398] [2024-11-12 12:45:42,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:45:42,448 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:45:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:45:42,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:45:42,512 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:45:42,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-12 12:45:42,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-12 12:45:42,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-12 12:45:42,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-12 12:45:42,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-12 12:45:42,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-12 12:45:42,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-12 12:45:42,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-12 12:45:42,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-12 12:45:42,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-12 12:45:42,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-12 12:45:42,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-12 12:45:42,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-12 12:45:42,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-12 12:45:42,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:45:42,515 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:45:42,515 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:45:42,516 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-12 12:45:42,558 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 12:45:42,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 292 transitions, 602 flow [2024-11-12 12:45:42,593 INFO L124 PetriNetUnfolderBase]: 13/434 cut-off events. [2024-11-12 12:45:42,594 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 12:45:42,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 434 events. 13/434 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 581 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 358. Up to 8 conditions per place. [2024-11-12 12:45:42,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 292 transitions, 602 flow [2024-11-12 12:45:42,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 292 transitions, 602 flow [2024-11-12 12:45:42,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:45:42,600 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@674c3d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:45:42,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-12 12:45:42,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:45:42,606 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-12 12:45:42,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:45:42,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:42,606 INFO L206 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, 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] [2024-11-12 12:45:42,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-12 12:45:42,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -176942728, now seen corresponding path program 1 times [2024-11-12 12:45:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159994699] [2024-11-12 12:45:42,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159994699] [2024-11-12 12:45:42,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159994699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:42,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:42,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:42,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851419705] [2024-11-12 12:45:42,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:42,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:42,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:42,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:42,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 292 [2024-11-12 12:45:42,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:42,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:42,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 292 [2024-11-12 12:45:42,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:51,997 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2024-11-12 12:45:51,997 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-12 12:45:52,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2925. Compared 957543 event pairs, 14941 based on Foata normal form. 986/71986 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2024-11-12 12:45:52,495 INFO L140 encePairwiseOnDemand]: 270/292 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2024-11-12 12:45:52,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2024-11-12 12:45:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:45:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:45:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2024-11-12 12:45:52,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2024-11-12 12:45:52,498 INFO L175 Difference]: Start difference. First operand has 295 places, 292 transitions, 602 flow. Second operand 3 states and 831 transitions. [2024-11-12 12:45:52,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2024-11-12 12:45:52,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-12 12:45:52,506 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2024-11-12 12:45:52,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2024-11-12 12:45:52,507 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2024-11-12 12:45:52,507 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2024-11-12 12:45:52,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:52,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:45:52,508 INFO L206 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, 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] [2024-11-12 12:45:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:45:52,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-12 12:45:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:45:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1511854987, now seen corresponding path program 1 times [2024-11-12 12:45:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:45:52,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479555137] [2024-11-12 12:45:52,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:45:52,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:45:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:45:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:45:52,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:45:52,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479555137] [2024-11-12 12:45:52,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479555137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:45:52,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:45:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:45:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859992884] [2024-11-12 12:45:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:45:52,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:45:52,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:45:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:45:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:45:52,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 292 [2024-11-12 12:45:52,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:45:52,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:45:52,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 292 [2024-11-12 12:45:52,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:45:57,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:45:57,110 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:45:57,111 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:45:57,111 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,111 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,551 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:45:57,552 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-12 12:45:57,552 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,552 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,552 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,552 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-12 12:45:57,553 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:45:57,553 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-12 12:45:57,553 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,553 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,553 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-12 12:45:57,553 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-12 12:45:57,787 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:45:57,787 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-12 12:45:57,787 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:57,787 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:57,787 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-12 12:45:57,787 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:57,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:45:57,788 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-12 12:45:57,788 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-12 12:45:57,788 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:57,788 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-12 12:45:58,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [33#L691-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:45:58,701 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-12 12:45:58,702 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-12 12:45:58,702 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-12 12:45:58,702 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-12 12:45:58,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 33#L691-3true, 44#L695-5true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:45:58,703 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-12 12:45:58,704 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-12 12:45:58,704 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-12 12:45:58,704 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-12 12:45:59,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:45:59,669 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-12 12:45:59,669 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-12 12:45:59,669 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:45:59,669 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-12 12:45:59,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:45:59,672 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-12 12:45:59,672 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:45:59,672 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-12 12:45:59,672 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-12 12:46:00,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:00,308 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:00,309 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:46:00,309 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,309 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,310 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,789 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:46:00,790 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-12 12:46:00,790 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-12 12:46:00,790 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,790 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,790 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,792 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:46:00,792 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-12 12:46:00,792 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,792 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-12 12:46:00,792 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:00,792 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-12 12:46:01,038 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:01,038 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-12 12:46:01,038 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-12 12:46:01,038 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:01,038 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:01,038 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:01,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:46:01,039 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-12 12:46:01,039 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:01,039 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-12 12:46:01,039 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:01,041 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:01,041 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:46:01,041 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,041 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,284 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:01,284 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-12 12:46:01,284 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,284 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-12 12:46:01,284 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,284 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,286 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:01,286 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-12 12:46:01,286 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-12 12:46:01,286 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,286 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,286 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-12 12:46:01,767 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:01,767 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-12 12:46:01,767 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:01,767 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-12 12:46:01,767 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:01,768 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:01,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 262#L694-3true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:46:01,768 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-12 12:46:01,768 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-12 12:46:01,768 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:01,768 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-12 12:46:02,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [156#L693-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:46:02,027 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-12 12:46:02,027 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-12 12:46:02,027 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-12 12:46:02,027 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-12 12:46:02,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 156#L693-3true, 44#L695-5true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:46:02,030 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-12 12:46:02,030 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-12 12:46:02,030 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-12 12:46:02,030 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-12 12:46:02,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [262#L694-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:46:02,782 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-12 12:46:02,782 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-12 12:46:02,782 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-12 12:46:02,782 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-12 12:46:02,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 44#L695-5true, 262#L694-3true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-12 12:46:02,785 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-12 12:46:02,785 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-12 12:46:02,786 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-12 12:46:02,786 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-12 12:46:03,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:46:03,028 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-12 12:46:03,028 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-12 12:46:03,028 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-12 12:46:03,028 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-12 12:46:03,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:03,031 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-12 12:46:03,031 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-12 12:46:03,031 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-12 12:46:03,032 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-12 12:46:03,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 262#L694-3true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-12 12:46:03,481 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-12 12:46:03,481 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-12 12:46:03,481 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-12 12:46:03,481 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-12 12:46:03,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 262#L694-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-12 12:46:03,485 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-12 12:46:03,485 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-12 12:46:03,486 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-12 12:46:03,486 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event