./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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-ext/31_simple_loop5_vs.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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:33:00,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:33:00,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:33:00,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:33:00,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:33:00,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:33:00,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:33:00,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:33:00,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:33:00,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:33:00,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:33:00,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:33:00,142 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:33:00,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:33:00,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:33:00,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:33:00,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:33:00,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:33:00,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:33:00,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:33:00,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:33:00,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:33:00,147 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:33:00,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:33:00,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:33:00,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:33:00,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:33:00,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:33:00,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:33:00,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:33:00,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:33:00,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:33:00,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:33:00,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:33:00,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:33:00,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:33:00,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:33:00,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:33:00,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:33:00,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:33:00,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:33:00,157 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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2024-11-09 06:33:00,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:33:00,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:33:00,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:33:00,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:33:00,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:33:00,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-11-09 06:33:01,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:33:02,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:33:02,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-11-09 06:33:02,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63572225/a3a7d55935f04353b30583371abd0f8d/FLAG5c5b04263 [2024-11-09 06:33:02,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63572225/a3a7d55935f04353b30583371abd0f8d [2024-11-09 06:33:02,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:33:02,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:33:02,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:33:02,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:33:02,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:33:02,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12788011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02, skipping insertion in model container [2024-11-09 06:33:02,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:33:02,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:33:02,421 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:33:02,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:33:02,487 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:33:02,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02 WrapperNode [2024-11-09 06:33:02,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:33:02,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:33:02,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:33:02,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:33:02,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,536 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-09 06:33:02,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:33:02,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:33:02,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:33:02,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:33:02,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:33:02,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:33:02,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:33:02,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:33:02,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (1/1) ... [2024-11-09 06:33:02,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:33:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:33:02,595 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-09 06:33:02,598 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-09 06:33:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-09 06:33:02,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-09 06:33:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 06:33:02,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 06:33:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:33:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:33:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:33:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:33:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:33:02,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:33:02,636 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:33:02,736 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:33:02,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:33:02,908 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:33:02,909 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:33:02,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:33:02,941 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 06:33:02,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:33:02 BoogieIcfgContainer [2024-11-09 06:33:02,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:33:02,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:33:02,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:33:02,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:33:02,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:33:02" (1/3) ... [2024-11-09 06:33:02,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0d6e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:02, skipping insertion in model container [2024-11-09 06:33:02,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:33:02" (2/3) ... [2024-11-09 06:33:02,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0d6e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:33:02, skipping insertion in model container [2024-11-09 06:33:02,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:33:02" (3/3) ... [2024-11-09 06:33:02,952 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2024-11-09 06:33:02,968 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:33:02,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 06:33:02,968 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:33:03,033 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:33:03,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 108 transitions, 224 flow [2024-11-09 06:33:03,117 INFO L124 PetriNetUnfolderBase]: 7/116 cut-off events. [2024-11-09 06:33:03,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:33:03,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 116 events. 7/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 176 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 94. Up to 4 conditions per place. [2024-11-09 06:33:03,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 108 transitions, 224 flow [2024-11-09 06:33:03,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 107 transitions, 221 flow [2024-11-09 06:33:03,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:33:03,140 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;@70da2155, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:33:03,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-09 06:33:03,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:33:03,157 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-09 06:33:03,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:33:03,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:03,158 INFO L204 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] [2024-11-09 06:33:03,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:33:03,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:03,163 INFO L85 PathProgramCache]: Analyzing trace with hash 672884579, now seen corresponding path program 1 times [2024-11-09 06:33:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:03,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831242949] [2024-11-09 06:33:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:03,417 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-09 06:33:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831242949] [2024-11-09 06:33:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831242949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:03,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141202004] [2024-11-09 06:33:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:03,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:03,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:03,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2024-11-09 06:33:03,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-09 06:33:03,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:03,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2024-11-09 06:33:03,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:03,628 INFO L124 PetriNetUnfolderBase]: 52/358 cut-off events. [2024-11-09 06:33:03,629 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 06:33:03,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 358 events. 52/358 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1427 event pairs, 13 based on Foata normal form. 86/390 useless extension candidates. Maximal degree in co-relation 450. Up to 70 conditions per place. [2024-11-09 06:33:03,634 INFO L140 encePairwiseOnDemand]: 95/108 looper letters, 16 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2024-11-09 06:33:03,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 98 transitions, 246 flow [2024-11-09 06:33:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:33:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-11-09 06:33:03,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-11-09 06:33:03,650 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 221 flow. Second operand 3 states and 297 transitions. [2024-11-09 06:33:03,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 98 transitions, 246 flow [2024-11-09 06:33:03,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 98 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:33:03,659 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 216 flow [2024-11-09 06:33:03,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2024-11-09 06:33:03,664 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -10 predicate places. [2024-11-09 06:33:03,664 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 216 flow [2024-11-09 06:33:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-09 06:33:03,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:03,665 INFO L204 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] [2024-11-09 06:33:03,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:33:03,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:33:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1897970203, now seen corresponding path program 1 times [2024-11-09 06:33:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313763200] [2024-11-09 06:33:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:03,751 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-09 06:33:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:03,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313763200] [2024-11-09 06:33:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313763200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:03,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:03,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703118040] [2024-11-09 06:33:03,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:03,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:03,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:03,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:03,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2024-11-09 06:33:03,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-09 06:33:03,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:03,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2024-11-09 06:33:03,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:03,855 INFO L124 PetriNetUnfolderBase]: 87/610 cut-off events. [2024-11-09 06:33:03,856 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 06:33:03,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 610 events. 87/610 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3282 event pairs, 17 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 846. Up to 101 conditions per place. [2024-11-09 06:33:03,866 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 16 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2024-11-09 06:33:03,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 273 flow [2024-11-09 06:33:03,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:33:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2024-11-09 06:33:03,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8734567901234568 [2024-11-09 06:33:03,872 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 216 flow. Second operand 3 states and 283 transitions. [2024-11-09 06:33:03,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 273 flow [2024-11-09 06:33:03,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 100 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:33:03,877 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 236 flow [2024-11-09 06:33:03,877 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-11-09 06:33:03,878 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -9 predicate places. [2024-11-09 06:33:03,879 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 236 flow [2024-11-09 06:33:03,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-09 06:33:03,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:03,880 INFO L204 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] [2024-11-09 06:33:03,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:33:03,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-09 06:33:03,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash 696979939, now seen corresponding path program 1 times [2024-11-09 06:33:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:03,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935598698] [2024-11-09 06:33:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:33:03,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:33:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:33:03,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:33:03,943 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:33:03,944 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-11-09 06:33:03,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-11-09 06:33:03,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-11-09 06:33:03,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-11-09 06:33:03,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-11-09 06:33:03,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-11-09 06:33:03,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-11-09 06:33:03,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-11-09 06:33:03,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-11-09 06:33:03,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-11-09 06:33:03,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-11-09 06:33:03,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2024-11-09 06:33:03,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-11-09 06:33:03,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-11-09 06:33:03,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-11-09 06:33:03,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-11-09 06:33:03,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-11-09 06:33:03,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-11-09 06:33:03,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-11-09 06:33:03,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-11-09 06:33:03,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-11-09 06:33:03,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-11-09 06:33:03,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:33:03,953 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 06:33:03,955 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:33:03,955 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:33:04,002 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:33:04,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 178 transitions, 376 flow [2024-11-09 06:33:04,027 INFO L124 PetriNetUnfolderBase]: 9/172 cut-off events. [2024-11-09 06:33:04,027 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:33:04,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 172 events. 9/172 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 348 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 179. Up to 6 conditions per place. [2024-11-09 06:33:04,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 178 transitions, 376 flow [2024-11-09 06:33:04,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 152 transitions, 317 flow [2024-11-09 06:33:04,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:33:04,038 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;@70da2155, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:33:04,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-09 06:33:04,043 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:33:04,043 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-09 06:33:04,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:33:04,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:04,044 INFO L204 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] [2024-11-09 06:33:04,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-09 06:33:04,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1707766232, now seen corresponding path program 1 times [2024-11-09 06:33:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854705983] [2024-11-09 06:33:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:04,094 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-09 06:33:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854705983] [2024-11-09 06:33:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854705983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:04,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978614230] [2024-11-09 06:33:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:04,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:04,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:04,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:04,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 178 [2024-11-09 06:33:04,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-09 06:33:04,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:04,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 178 [2024-11-09 06:33:04,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:04,606 INFO L124 PetriNetUnfolderBase]: 881/3568 cut-off events. [2024-11-09 06:33:04,606 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-11-09 06:33:04,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5092 conditions, 3568 events. 881/3568 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 30852 event pairs, 288 based on Foata normal form. 795/3720 useless extension candidates. Maximal degree in co-relation 5060. Up to 813 conditions per place. [2024-11-09 06:33:04,640 INFO L140 encePairwiseOnDemand]: 159/178 looper letters, 28 selfloop transitions, 8 changer transitions 0/149 dead transitions. [2024-11-09 06:33:04,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 391 flow [2024-11-09 06:33:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:33:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2024-11-09 06:33:04,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8782771535580525 [2024-11-09 06:33:04,642 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 317 flow. Second operand 3 states and 469 transitions. [2024-11-09 06:33:04,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 391 flow [2024-11-09 06:33:04,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 149 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:33:04,648 INFO L231 Difference]: Finished difference. Result has 141 places, 141 transitions, 348 flow [2024-11-09 06:33:04,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=141, PETRI_TRANSITIONS=141} [2024-11-09 06:33:04,649 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -12 predicate places. [2024-11-09 06:33:04,650 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 141 transitions, 348 flow [2024-11-09 06:33:04,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-09 06:33:04,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:04,651 INFO L204 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] [2024-11-09 06:33:04,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:33:04,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-09 06:33:04,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash -485823702, now seen corresponding path program 1 times [2024-11-09 06:33:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:04,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564180870] [2024-11-09 06:33:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:04,703 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-09 06:33:04,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564180870] [2024-11-09 06:33:04,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564180870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:04,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:04,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:04,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276200189] [2024-11-09 06:33:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:04,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:04,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:04,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 178 [2024-11-09 06:33:04,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 141 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-09 06:33:04,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:04,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 178 [2024-11-09 06:33:04,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:05,994 INFO L124 PetriNetUnfolderBase]: 2733/11119 cut-off events. [2024-11-09 06:33:05,995 INFO L125 PetriNetUnfolderBase]: For 718/721 co-relation queries the response was YES. [2024-11-09 06:33:06,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16972 conditions, 11119 events. 2733/11119 cut-off events. For 718/721 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 126961 event pairs, 711 based on Foata normal form. 0/9269 useless extension candidates. Maximal degree in co-relation 16939. Up to 2139 conditions per place. [2024-11-09 06:33:06,114 INFO L140 encePairwiseOnDemand]: 167/178 looper letters, 28 selfloop transitions, 8 changer transitions 0/157 dead transitions. [2024-11-09 06:33:06,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 157 transitions, 460 flow [2024-11-09 06:33:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:33:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2024-11-09 06:33:06,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.848314606741573 [2024-11-09 06:33:06,116 INFO L175 Difference]: Start difference. First operand has 141 places, 141 transitions, 348 flow. Second operand 3 states and 453 transitions. [2024-11-09 06:33:06,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 157 transitions, 460 flow [2024-11-09 06:33:06,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 157 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:33:06,126 INFO L231 Difference]: Finished difference. Result has 143 places, 149 transitions, 402 flow [2024-11-09 06:33:06,126 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=143, PETRI_TRANSITIONS=149} [2024-11-09 06:33:06,128 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -10 predicate places. [2024-11-09 06:33:06,128 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 149 transitions, 402 flow [2024-11-09 06:33:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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-09 06:33:06,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:06,129 INFO L204 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] [2024-11-09 06:33:06,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:33:06,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-09 06:33:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash -624411761, now seen corresponding path program 1 times [2024-11-09 06:33:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799982921] [2024-11-09 06:33:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:06,166 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-09 06:33:06,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799982921] [2024-11-09 06:33:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799982921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:06,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:06,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:06,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867432442] [2024-11-09 06:33:06,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:06,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:06,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 178 [2024-11-09 06:33:06,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 149 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-09 06:33:06,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:06,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 178 [2024-11-09 06:33:06,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:07,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([489] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][50], [130#L695-5true, 172#true, 44#L708-2true, Black: 180#true, 190#true, 187#(= |#race~b~0| 0), 176#true, Black: 185#true, 118#L694-1true, 174#true, 94#L717-4true]) [2024-11-09 06:33:07,417 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-09 06:33:07,417 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:07,417 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-11-09 06:33:07,417 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:07,718 INFO L124 PetriNetUnfolderBase]: 3513/14476 cut-off events. [2024-11-09 06:33:07,718 INFO L125 PetriNetUnfolderBase]: For 912/917 co-relation queries the response was YES. [2024-11-09 06:33:07,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22818 conditions, 14476 events. 3513/14476 cut-off events. For 912/917 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 173848 event pairs, 1504 based on Foata normal form. 0/12195 useless extension candidates. Maximal degree in co-relation 22784. Up to 3347 conditions per place. [2024-11-09 06:33:07,834 INFO L140 encePairwiseOnDemand]: 172/178 looper letters, 21 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2024-11-09 06:33:07,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 158 transitions, 477 flow [2024-11-09 06:33:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:33:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2024-11-09 06:33:07,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8595505617977528 [2024-11-09 06:33:07,836 INFO L175 Difference]: Start difference. First operand has 143 places, 149 transitions, 402 flow. Second operand 3 states and 459 transitions. [2024-11-09 06:33:07,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 158 transitions, 477 flow [2024-11-09 06:33:07,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 158 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:33:07,844 INFO L231 Difference]: Finished difference. Result has 145 places, 153 transitions, 424 flow [2024-11-09 06:33:07,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=145, PETRI_TRANSITIONS=153} [2024-11-09 06:33:07,845 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -8 predicate places. [2024-11-09 06:33:07,845 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 153 transitions, 424 flow [2024-11-09 06:33:07,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-09 06:33:07,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:07,846 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2024-11-09 06:33:07,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:33:07,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-09 06:33:07,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1281657640, now seen corresponding path program 1 times [2024-11-09 06:33:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895578664] [2024-11-09 06:33:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:33:07,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:33:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:33:07,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:33:07,873 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:33:07,873 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2024-11-09 06:33:07,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2024-11-09 06:33:07,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 32 remaining) [2024-11-09 06:33:07,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2024-11-09 06:33:07,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2024-11-09 06:33:07,876 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2024-11-09 06:33:07,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2024-11-09 06:33:07,877 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2024-11-09 06:33:07,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:33:07,877 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 06:33:07,878 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:33:07,878 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 06:33:07,918 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:33:07,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 248 transitions, 532 flow [2024-11-09 06:33:07,941 INFO L124 PetriNetUnfolderBase]: 11/228 cut-off events. [2024-11-09 06:33:07,942 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 06:33:07,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 228 events. 11/228 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 575 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2024-11-09 06:33:07,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 248 transitions, 532 flow [2024-11-09 06:33:07,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 197 transitions, 415 flow [2024-11-09 06:33:07,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:33:07,948 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;@70da2155, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:33:07,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-09 06:33:07,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:33:07,954 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-09 06:33:07,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:33:07,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:07,954 INFO L204 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] [2024-11-09 06:33:07,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2024-11-09 06:33:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1735086381, now seen corresponding path program 1 times [2024-11-09 06:33:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:07,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424388003] [2024-11-09 06:33:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:07,987 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-09 06:33:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424388003] [2024-11-09 06:33:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424388003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312463055] [2024-11-09 06:33:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:08,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 248 [2024-11-09 06:33:08,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 197 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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-09 06:33:08,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:08,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 248 [2024-11-09 06:33:08,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:11,043 INFO L124 PetriNetUnfolderBase]: 10763/31503 cut-off events. [2024-11-09 06:33:11,043 INFO L125 PetriNetUnfolderBase]: For 2767/2767 co-relation queries the response was YES. [2024-11-09 06:33:11,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48086 conditions, 31503 events. 10763/31503 cut-off events. For 2767/2767 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 373569 event pairs, 3318 based on Foata normal form. 6558/32271 useless extension candidates. Maximal degree in co-relation 48053. Up to 8400 conditions per place. [2024-11-09 06:33:11,403 INFO L140 encePairwiseOnDemand]: 224/248 looper letters, 38 selfloop transitions, 11 changer transitions 0/197 dead transitions. [2024-11-09 06:33:11,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 197 transitions, 528 flow [2024-11-09 06:33:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:33:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2024-11-09 06:33:11,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8575268817204301 [2024-11-09 06:33:11,406 INFO L175 Difference]: Start difference. First operand has 199 places, 197 transitions, 415 flow. Second operand 3 states and 638 transitions. [2024-11-09 06:33:11,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 197 transitions, 528 flow [2024-11-09 06:33:11,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 197 transitions, 523 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 06:33:11,412 INFO L231 Difference]: Finished difference. Result has 184 places, 186 transitions, 464 flow [2024-11-09 06:33:11,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=184, PETRI_TRANSITIONS=186} [2024-11-09 06:33:11,413 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -15 predicate places. [2024-11-09 06:33:11,414 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 186 transitions, 464 flow [2024-11-09 06:33:11,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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-09 06:33:11,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:11,415 INFO L204 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] [2024-11-09 06:33:11,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:33:11,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2024-11-09 06:33:11,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:11,415 INFO L85 PathProgramCache]: Analyzing trace with hash 970729583, now seen corresponding path program 1 times [2024-11-09 06:33:11,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039565025] [2024-11-09 06:33:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:11,450 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-09 06:33:11,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039565025] [2024-11-09 06:33:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039565025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721107970] [2024-11-09 06:33:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:11,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:11,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:11,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 248 [2024-11-09 06:33:11,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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-09 06:33:11,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:11,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 248 [2024-11-09 06:33:11,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:23,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-4-->L695-5: Formula: (= |v_#race~a~0_4| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][83], [26#L694-2true, 241#true, 73#L694-2true, 243#true, 180#L717-4true, 249#true, 103#L695-5true, 239#true, Black: 251#(= |#race~a~0| 0), 144#L707-3true, 237#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:23,067 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:23,067 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-11-09 06:33:23,068 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-09 06:33:23,068 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-09 06:33:23,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-4-->L695-5: Formula: (= |v_#race~a~0_4| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][83], [139#L707-4true, 26#L694-2true, 241#true, 73#L694-2true, 243#true, 180#L717-4true, 249#true, 103#L695-5true, 239#true, Black: 251#(= |#race~a~0| 0), 237#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:23,391 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:23,392 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-09 06:33:23,392 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 06:33:23,392 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-09 06:33:24,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][147], [26#L694-2true, 241#true, 251#(= |#race~a~0| 0), 243#true, 180#L717-4true, 50#L695-1true, 187#L695-1true, 239#true, Black: 249#true, 237#true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:24,108 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-09 06:33:24,108 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-11-09 06:33:24,108 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-09 06:33:24,108 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-09 06:33:24,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-4-->L695-5: Formula: (= |v_#race~a~0_4| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][83], [26#L694-2true, 241#true, 29#L708-2true, 73#L694-2true, 243#true, 180#L717-4true, 103#L695-5true, 249#true, 239#true, Black: 251#(= |#race~a~0| 0), 237#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:24,161 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-11-09 06:33:24,161 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-09 06:33:24,161 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-09 06:33:24,161 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-09 06:33:24,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-4-->L695-5: Formula: (= |v_#race~a~0_4| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][83], [241#true, 73#L694-2true, 122#L694-1true, 243#true, 180#L717-4true, 103#L695-5true, 249#true, 239#true, Black: 251#(= |#race~a~0| 0), 237#true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:24,355 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-09 06:33:24,355 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-11-09 06:33:24,355 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-09 06:33:24,355 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-09 06:33:24,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][147], [26#L694-2true, 241#true, 251#(= |#race~a~0| 0), 243#true, 180#L717-4true, 50#L695-1true, 239#true, Black: 249#true, 237#true, 125#L695-2true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:24,357 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-09 06:33:24,357 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-09 06:33:24,357 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-09 06:33:24,357 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-09 06:33:24,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-4-->L695-5: Formula: (= |v_#race~a~0_4| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][83], [26#L694-2true, 241#true, 73#L694-2true, 243#true, 180#L717-4true, 249#true, 103#L695-5true, 239#true, Black: 251#(= |#race~a~0| 0), 237#true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:24,832 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2024-11-09 06:33:24,832 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-09 06:33:24,832 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-09 06:33:24,832 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-09 06:33:25,047 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([707] L695-4-->L695-5: Formula: (= |v_#race~a~0_4| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][83], [26#L694-2true, 241#true, 73#L694-2true, 243#true, 180#L717-4true, 103#L695-5true, 249#true, 239#true, Black: 251#(= |#race~a~0| 0), 237#true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:25,047 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2024-11-09 06:33:25,047 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-09 06:33:25,047 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-09 06:33:25,048 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-09 06:33:25,048 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-09 06:33:25,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([707] L695-4-->L695-5: Formula: (= |v_#race~a~0_4| |v_thr2Thread1of3ForFork0_#t~nondet3_3|) InVars {thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork0_#t~nondet3=|v_thr2Thread1of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][83], [26#L694-2true, 241#true, 243#true, 180#L717-4true, 103#L695-5true, 249#true, 108#L694-1true, 239#true, Black: 251#(= |#race~a~0| 0), 237#true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:25,048 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-11-09 06:33:25,048 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-09 06:33:25,048 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2024-11-09 06:33:25,048 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-11-09 06:33:25,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][147], [130#L695-2true, 241#true, 251#(= |#race~a~0| 0), 243#true, 180#L717-4true, 50#L695-1true, 103#L695-5true, 239#true, Black: 249#true, 237#true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:25,944 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-09 06:33:25,944 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-09 06:33:25,944 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-09 06:33:25,944 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-09 06:33:27,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([854] L707-2-->L707-3: Formula: (= |v_#race~b~0_7| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_7|} AuxVars[] AssignedVars[#race~b~0][37], [90#thr2Err0ASSERT_VIOLATIONDATA_RACEtrue, 241#true, 251#(= |#race~a~0| 0), 243#true, 180#L717-4true, 53#L693-2true, 239#true, Black: 249#true, 52#L695-5true, 144#L707-3true, 237#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:27,892 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-11-09 06:33:27,892 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-09 06:33:27,893 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-09 06:33:27,893 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][76], [90#thr2Err0ASSERT_VIOLATIONDATA_RACEtrue, 241#true, 251#(= |#race~a~0| 0), 122#L694-1true, 243#true, 180#L717-4true, 128#L707-2true, 254#true, 239#true, Black: 249#true, 52#L695-5true, 237#true]) [2024-11-09 06:33:27,924 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][76], [90#thr2Err0ASSERT_VIOLATIONDATA_RACEtrue, 241#true, 251#(= |#race~a~0| 0), 122#L694-1true, 243#true, 180#L717-4true, 254#true, 239#true, Black: 249#true, 52#L695-5true, 237#true, 232#L707-1true]) [2024-11-09 06:33:27,924 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-09 06:33:27,924 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-09 06:33:28,462 INFO L124 PetriNetUnfolderBase]: 52970/162108 cut-off events. [2024-11-09 06:33:28,462 INFO L125 PetriNetUnfolderBase]: For 11564/11735 co-relation queries the response was YES. [2024-11-09 06:33:29,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258821 conditions, 162108 events. 52970/162108 cut-off events. For 11564/11735 co-relation queries the response was YES. Maximal size of possible extension queue 4788. Compared 2495395 event pairs, 15099 based on Foata normal form. 0/134655 useless extension candidates. Maximal degree in co-relation 258787. Up to 35464 conditions per place. [2024-11-09 06:33:30,435 INFO L140 encePairwiseOnDemand]: 233/248 looper letters, 38 selfloop transitions, 11 changer transitions 0/208 dead transitions. [2024-11-09 06:33:30,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 208 transitions, 619 flow [2024-11-09 06:33:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:33:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:33:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-11-09 06:33:30,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-09 06:33:30,441 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 464 flow. Second operand 3 states and 620 transitions. [2024-11-09 06:33:30,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 208 transitions, 619 flow [2024-11-09 06:33:30,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 208 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:33:30,505 INFO L231 Difference]: Finished difference. Result has 186 places, 197 transitions, 538 flow [2024-11-09 06:33:30,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=186, PETRI_TRANSITIONS=197} [2024-11-09 06:33:30,506 INFO L277 CegarLoopForPetriNet]: 199 programPoint places, -13 predicate places. [2024-11-09 06:33:30,506 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 197 transitions, 538 flow [2024-11-09 06:33:30,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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-09 06:33:30,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:33:30,507 INFO L204 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] [2024-11-09 06:33:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:33:30,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err3ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2024-11-09 06:33:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash -746709020, now seen corresponding path program 1 times [2024-11-09 06:33:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:33:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134057439] [2024-11-09 06:33:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:30,539 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-09 06:33:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:33:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134057439] [2024-11-09 06:33:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134057439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:33:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:33:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:33:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414380898] [2024-11-09 06:33:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:33:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:33:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:33:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:33:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:33:30,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 248 [2024-11-09 06:33:30,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 197 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 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-09 06:33:30,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:33:30,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 248 [2024-11-09 06:33:30,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:33:39,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][48], [Black: 254#true, 140#L695-5true, 240#true, 29#L708-2true, 49#L694-1true, 243#true, 180#L717-4true, 259#true, 239#true, Black: 249#true, 237#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:39,301 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2024-11-09 06:33:39,301 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-11-09 06:33:39,301 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:39,301 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:44,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][66], [Black: 254#true, 29#L708-2true, 122#L694-1true, 243#true, 259#true, 239#true, 52#L695-5true, 237#true, 40#$Ultimate##0true, 241#true, 180#L717-4true, Black: 249#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:44,132 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-11-09 06:33:44,132 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-09 06:33:44,132 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-09 06:33:44,132 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-09 06:33:45,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 139#L707-4true, 243#true, 210#L693-2true, 259#true, 187#L695-1true, 239#true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:45,289 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:45,289 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-09 06:33:45,289 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-09 06:33:45,289 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-09 06:33:45,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 243#true, 210#L693-2true, 259#true, 187#L695-1true, 239#true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 144#L707-3true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:45,290 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2024-11-09 06:33:45,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-09 06:33:45,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-09 06:33:45,290 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-09 06:33:45,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L707-8-->L708-2: Formula: (and (= |v_thr1Thread1of3ForFork1_#t~ret8#1_1| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#mutex~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#mutex~0.base_25|) |v_~#mutex~0.offset_25| 0)))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#mutex~0.base=|v_~#mutex~0.base_25|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread1of3ForFork1_#t~ret8#1=|v_thr1Thread1of3ForFork1_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork1_#t~ret8#1][47], [Black: 254#true, 29#L708-2true, 243#true, 50#L695-1true, 259#true, 239#true, 237#true, 158#L693-2true, 241#true, 67#L694-5true, 180#L717-4true, Black: 249#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:45,653 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2024-11-09 06:33:45,654 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-09 06:33:45,654 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 06:33:45,654 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-09 06:33:45,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [139#L707-4true, Black: 254#true, 243#true, 210#L693-2true, 259#true, 239#true, 125#L695-2true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:45,786 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:45,786 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-09 06:33:45,786 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-09 06:33:45,786 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-09 06:33:45,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 243#true, 210#L693-2true, 259#true, 239#true, 125#L695-2true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 144#L707-3true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:45,786 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:45,786 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-09 06:33:45,786 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-09 06:33:45,786 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-09 06:33:46,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][66], [Black: 254#true, 29#L708-2true, 122#L694-1true, 243#true, 259#true, 239#true, 52#L695-5true, 237#true, 241#true, 180#L717-4true, 207#L694-4true, Black: 249#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:46,005 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-09 06:33:46,005 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-09 06:33:46,005 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-09 06:33:46,005 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2024-11-09 06:33:46,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 243#true, 259#true, 50#L695-1true, 239#true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 144#L707-3true, 163#L695-1true, 178#L697-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:46,754 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:46,754 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:46,754 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:46,754 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 139#L707-4true, 243#true, 259#true, 239#true, 237#true, 158#L693-2true, 241#true, 165#L695-2true, 180#L717-4true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,003 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 139#L707-4true, 243#true, 259#true, 50#L695-1true, 239#true, 237#true, 158#L693-2true, 241#true, 180#L717-4true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,003 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-11-09 06:33:47,003 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 243#true, 259#true, 239#true, 237#true, 158#L693-2true, 241#true, 165#L695-2true, 180#L717-4true, 144#L707-3true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,004 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 243#true, 259#true, 50#L695-1true, 239#true, 237#true, 158#L693-2true, 241#true, 180#L717-4true, 144#L707-3true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,004 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-09 06:33:47,004 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-11-09 06:33:47,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [75#L697-1true, Black: 254#true, 243#true, 259#true, 187#L695-1true, 239#true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 144#L707-3true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,205 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:47,205 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:47,205 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:47,205 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:47,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [75#L697-1true, 139#L707-4true, Black: 254#true, 243#true, 259#true, 187#L695-1true, 239#true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,205 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,205 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,205 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,205 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [139#L707-4true, Black: 254#true, 243#true, 259#true, 50#L695-1true, 239#true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 163#L695-1true, 178#L697-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,222 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,222 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,223 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,223 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [Black: 254#true, 243#true, 259#true, 239#true, 237#true, 241#true, 180#L717-4true, 165#L695-2true, Black: 249#true, 144#L707-3true, 163#L695-1true, 178#L697-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,224 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,224 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,224 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,224 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] L695-4-->L695-5: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_4|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][110], [Black: 254#true, 29#L708-2true, 243#true, 259#true, 108#L694-1true, 239#true, 237#true, 140#L695-5true, 49#L694-1true, 241#true, 180#L717-4true, Black: 251#(= |#race~a~0| 0), 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,364 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,364 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-11-09 06:33:47,364 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,364 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [75#L697-1true, Black: 254#true, 243#true, 259#true, 239#true, 125#L695-2true, 237#true, 241#true, 180#L717-4true, 144#L707-3true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,681 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [75#L697-1true, 139#L707-4true, Black: 254#true, 243#true, 259#true, 239#true, 125#L695-2true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 163#L695-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:47,681 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-09 06:33:47,681 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-09 06:33:48,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L707-8-->L708-2: Formula: (and (= |v_thr1Thread1of3ForFork1_#t~ret8#1_1| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#mutex~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#mutex~0.base_25|) |v_~#mutex~0.offset_25| 0)))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#mutex~0.base=|v_~#mutex~0.base_25|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread1of3ForFork1_#t~ret8#1=|v_thr1Thread1of3ForFork1_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork1_#t~ret8#1][47], [Black: 254#true, 29#L708-2true, 243#true, 50#L695-1true, 259#true, 239#true, 237#true, 241#true, 180#L717-4true, 67#L694-5true, Black: 249#true, 178#L697-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,043 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2024-11-09 06:33:48,043 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:48,043 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:48,043 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2024-11-09 06:33:48,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] L695-->L695-1: Formula: (= |v_#race~b~0_1| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_1|} AuxVars[] AssignedVars[#race~b~0][119], [139#L707-4true, Black: 254#true, 243#true, 259#true, 239#true, 237#true, 241#true, 165#L695-2true, 180#L717-4true, Black: 249#true, 163#L695-1true, 178#L697-1true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,043 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-09 06:33:48,043 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-09 06:33:48,043 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-09 06:33:48,043 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-09 06:33:48,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][66], [Black: 254#true, 122#L694-1true, 243#true, 259#true, 239#true, 52#L695-5true, 237#true, 241#true, 180#L717-4true, 207#L694-4true, Black: 249#true, 142#L706-3true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,094 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-09 06:33:48,094 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-09 06:33:48,094 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-09 06:33:48,094 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-09 06:33:48,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L707-8-->L708-2: Formula: (and (= |v_thr1Thread1of3ForFork1_#t~ret8#1_1| 0) (= |v_#pthreadsMutex_37| (store |v_#pthreadsMutex_38| |v_~#mutex~0.base_25| (store (select |v_#pthreadsMutex_38| |v_~#mutex~0.base_25|) |v_~#mutex~0.offset_25| 0)))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_38|, ~#mutex~0.base=|v_~#mutex~0.base_25|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_25|, #pthreadsMutex=|v_#pthreadsMutex_37|, thr1Thread1of3ForFork1_#t~ret8#1=|v_thr1Thread1of3ForFork1_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_25|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork1_#t~ret8#1][76], [Black: 254#true, 29#L708-2true, 104#L694-6true, 122#L694-1true, 243#true, 210#L693-2true, 239#true, 237#true, 241#true, 180#L717-4true, Black: 249#true, 256#(= |#race~b~0| 0), 261#(= |thr2Thread1of3ForFork0_#t~nondet2| |#race~temp~0|)]) [2024-11-09 06:33:48,103 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-11-09 06:33:48,104 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-09 06:33:48,104 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-09 06:33:48,104 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-09 06:33:48,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] L694-->L694-1: Formula: (= |v_#race~a~0_1| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_1|} AuxVars[] AssignedVars[#race~a~0][66], [Black: 254#true, 29#L708-2true, 122#L694-1true, 243#true, 259#true, 239#true, 52#L695-5true, 237#true, 51#L695true, 241#true, 180#L717-4true, Black: 249#true, 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,174 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-09 06:33:48,174 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-09 06:33:48,174 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-09 06:33:48,174 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-09 06:33:48,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] L695-4-->L695-5: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_4|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][110], [Black: 254#true, 29#L708-2true, 243#true, 259#true, 108#L694-1true, 239#true, 237#true, 81#L694-2true, 140#L695-5true, 241#true, 180#L717-4true, Black: 251#(= |#race~a~0| 0), 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,188 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-09 06:33:48,188 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-09 06:33:48,188 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-09 06:33:48,188 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-09 06:33:48,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] L695-4-->L695-5: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_4|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][110], [Black: 254#true, 29#L708-2true, 73#L694-2true, 243#true, 259#true, 239#true, 237#true, 140#L695-5true, 49#L694-1true, 241#true, 180#L717-4true, Black: 251#(= |#race~a~0| 0), 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,189 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-09 06:33:48,189 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-09 06:33:48,189 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-09 06:33:48,189 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-09 06:33:48,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] L695-4-->L695-5: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_4|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][110], [Black: 254#true, 29#L708-2true, 73#L694-2true, 243#true, 259#true, 239#true, 237#true, 81#L694-2true, 140#L695-5true, 241#true, 180#L717-4true, Black: 251#(= |#race~a~0| 0), 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,625 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-11-09 06:33:48,625 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-09 06:33:48,625 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-09 06:33:48,625 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-09 06:33:48,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] L695-4-->L695-5: Formula: (= |v_thr2Thread2of3ForFork0_#t~nondet3_3| |v_#race~a~0_4|) InVars {thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|} OutVars{thr2Thread2of3ForFork0_#t~nondet3=|v_thr2Thread2of3ForFork0_#t~nondet3_3|, #race~a~0=|v_#race~a~0_4|} AuxVars[] AssignedVars[#race~a~0][110], [Black: 254#true, 193#$Ultimate##0true, 73#L694-2true, 243#true, 259#true, 239#true, 237#true, 140#L695-5true, 241#true, 180#L717-4true, 103#L695-5true, Black: 251#(= |#race~a~0| 0), 256#(= |#race~b~0| 0)]) [2024-11-09 06:33:48,910 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-11-09 06:33:48,910 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-09 06:33:48,910 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-09 06:33:48,910 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event