./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 3289d67d 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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:15:23,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:15:23,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:15:23,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:15:23,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:15:23,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:15:23,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:15:23,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:15:23,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:15:23,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:15:23,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:15:23,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:15:23,191 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:15:23,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:15:23,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:15:23,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:15:23,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:15:23,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:15:23,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:15:23,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:15:23,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:15:23,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:15:23,197 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:15:23,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:15:23,197 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:15:23,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:15:23,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:15:23,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:15:23,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:15:23,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:15:23,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:15:23,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:15:23,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:15:23,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:15:23,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:15:23,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:15:23,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:15:23,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:15:23,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:15:23,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:15:23,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:15:23,202 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-16 23:15:23,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:15:23,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:15:23,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:15:23,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:15:23,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:15:23,545 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-16 23:15:24,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:15:25,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:15:25,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-11-16 23:15:25,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180d825a2/e2dfcd6f7e0f43feb8bf1f8f91b416ec/FLAG2aae0cfc4 [2024-11-16 23:15:25,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180d825a2/e2dfcd6f7e0f43feb8bf1f8f91b416ec [2024-11-16 23:15:25,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:15:25,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:15:25,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:15:25,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:15:25,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:15:25,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:15:25" (1/1) ... [2024-11-16 23:15:25,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5b32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:25, skipping insertion in model container [2024-11-16 23:15:25,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:15:25" (1/1) ... [2024-11-16 23:15:25,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:15:26,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:15:26,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:15:26,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:15:26,166 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:15:26,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26 WrapperNode [2024-11-16 23:15:26,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:15:26,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:15:26,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:15:26,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:15:26,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,217 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-11-16 23:15:26,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:15:26,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:15:26,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:15:26,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:15:26,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:15:26,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:15:26,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:15:26,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:15:26,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (1/1) ... [2024-11-16 23:15:26,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:15:26,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:15:26,301 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-16 23:15:26,306 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-16 23:15:26,358 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-16 23:15:26,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-16 23:15:26,359 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-16 23:15:26,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-16 23:15:26,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:15:26,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:15:26,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:15:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:15:26,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:15:26,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:15:26,362 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:15:26,554 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:15:26,556 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:15:26,738 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:15:26,738 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:15:26,774 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:15:26,774 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:15:26,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:15:26 BoogieIcfgContainer [2024-11-16 23:15:26,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:15:26,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:15:26,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:15:26,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:15:26,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:15:25" (1/3) ... [2024-11-16 23:15:26,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616caf84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:15:26, skipping insertion in model container [2024-11-16 23:15:26,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:15:26" (2/3) ... [2024-11-16 23:15:26,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616caf84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:15:26, skipping insertion in model container [2024-11-16 23:15:26,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:15:26" (3/3) ... [2024-11-16 23:15:26,783 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2024-11-16 23:15:26,798 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:15:26,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-16 23:15:26,799 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:15:26,870 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:15:26,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 111 transitions, 230 flow [2024-11-16 23:15:26,963 INFO L124 PetriNetUnfolderBase]: 7/120 cut-off events. [2024-11-16 23:15:26,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:15:26,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 120 events. 7/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 190 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2024-11-16 23:15:26,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 111 transitions, 230 flow [2024-11-16 23:15:26,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 110 transitions, 227 flow [2024-11-16 23:15:26,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:15:26,994 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;@50698f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:15:26,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-16 23:15:27,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:15:27,006 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2024-11-16 23:15:27,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:15:27,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:27,007 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] [2024-11-16 23:15:27,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-16 23:15:27,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -429600675, now seen corresponding path program 1 times [2024-11-16 23:15:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:27,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105649553] [2024-11-16 23:15:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:15:27,299 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-16 23:15:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:15:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105649553] [2024-11-16 23:15:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105649553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:15:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:15:27,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:15:27,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297640311] [2024-11-16 23:15:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:15:27,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:15:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:15:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:15:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:15:27,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2024-11-16 23:15:27,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-16 23:15:27,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:15:27,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2024-11-16 23:15:27,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:15:27,513 INFO L124 PetriNetUnfolderBase]: 49/387 cut-off events. [2024-11-16 23:15:27,514 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-16 23:15:27,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 387 events. 49/387 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1642 event pairs, 19 based on Foata normal form. 165/493 useless extension candidates. Maximal degree in co-relation 475. Up to 66 conditions per place. [2024-11-16 23:15:27,523 INFO L140 encePairwiseOnDemand]: 98/111 looper letters, 16 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2024-11-16 23:15:27,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 252 flow [2024-11-16 23:15:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:15:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:15:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2024-11-16 23:15:27,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2024-11-16 23:15:27,542 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 227 flow. Second operand 3 states and 306 transitions. [2024-11-16 23:15:27,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 252 flow [2024-11-16 23:15:27,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 101 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:15:27,550 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 222 flow [2024-11-16 23:15:27,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2024-11-16 23:15:27,556 INFO L277 CegarLoopForPetriNet]: 110 programPoint places, -10 predicate places. [2024-11-16 23:15:27,556 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 222 flow [2024-11-16 23:15:27,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-16 23:15:27,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:27,557 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] [2024-11-16 23:15:27,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:15:27,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-16 23:15:27,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash -529379906, now seen corresponding path program 1 times [2024-11-16 23:15:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:27,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368569103] [2024-11-16 23:15:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:15:27,667 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-16 23:15:27,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:15:27,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368569103] [2024-11-16 23:15:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368569103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:15:27,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:15:27,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:15:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288544100] [2024-11-16 23:15:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:15:27,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:15:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:15:27,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:15:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:15:27,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 111 [2024-11-16 23:15:27,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-16 23:15:27,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:15:27,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 111 [2024-11-16 23:15:27,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:15:27,831 INFO L124 PetriNetUnfolderBase]: 91/640 cut-off events. [2024-11-16 23:15:27,831 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-16 23:15:27,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 640 events. 91/640 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3464 event pairs, 23 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 880. Up to 105 conditions per place. [2024-11-16 23:15:27,860 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 16 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2024-11-16 23:15:27,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 103 transitions, 279 flow [2024-11-16 23:15:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:15:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:15:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-11-16 23:15:27,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8768768768768769 [2024-11-16 23:15:27,866 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 222 flow. Second operand 3 states and 292 transitions. [2024-11-16 23:15:27,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 103 transitions, 279 flow [2024-11-16 23:15:27,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:15:27,870 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 242 flow [2024-11-16 23:15:27,871 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2024-11-16 23:15:27,871 INFO L277 CegarLoopForPetriNet]: 110 programPoint places, -9 predicate places. [2024-11-16 23:15:27,872 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 242 flow [2024-11-16 23:15:27,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-16 23:15:27,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:27,872 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:15:27,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:15:27,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-16 23:15:27,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:27,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1874611619, now seen corresponding path program 1 times [2024-11-16 23:15:27,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:27,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886102109] [2024-11-16 23:15:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:27,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:15:27,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:15:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:15:27,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:15:27,966 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:15:27,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-11-16 23:15:27,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-11-16 23:15:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-11-16 23:15:27,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-11-16 23:15:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-11-16 23:15:27,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-11-16 23:15:27,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-11-16 23:15:27,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-11-16 23:15:27,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-11-16 23:15:27,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-11-16 23:15:27,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-11-16 23:15:27,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2024-11-16 23:15:27,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-11-16 23:15:27,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-11-16 23:15:27,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-11-16 23:15:27,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-11-16 23:15:27,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-11-16 23:15:27,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-11-16 23:15:27,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-11-16 23:15:27,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-11-16 23:15:27,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-11-16 23:15:27,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-11-16 23:15:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:15:27,978 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 23:15:27,981 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:15:27,981 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 23:15:28,034 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:15:28,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 183 transitions, 386 flow [2024-11-16 23:15:28,066 INFO L124 PetriNetUnfolderBase]: 9/178 cut-off events. [2024-11-16 23:15:28,067 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:15:28,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 178 events. 9/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 371 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 185. Up to 6 conditions per place. [2024-11-16 23:15:28,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 183 transitions, 386 flow [2024-11-16 23:15:28,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 156 transitions, 325 flow [2024-11-16 23:15:28,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:15:28,075 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;@50698f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:15:28,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-16 23:15:28,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:15:28,081 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2024-11-16 23:15:28,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:15:28,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:28,082 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] [2024-11-16 23:15:28,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-16 23:15:28,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1442608358, now seen corresponding path program 1 times [2024-11-16 23:15:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938676975] [2024-11-16 23:15:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:15:28,135 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-16 23:15:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:15:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938676975] [2024-11-16 23:15:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938676975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:15:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:15:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:15:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175321469] [2024-11-16 23:15:28,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:15:28,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:15:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:15:28,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:15:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:15:28,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 183 [2024-11-16 23:15:28,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 156 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-16 23:15:28,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:15:28,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 183 [2024-11-16 23:15:28,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:15:28,769 INFO L124 PetriNetUnfolderBase]: 861/3711 cut-off events. [2024-11-16 23:15:28,769 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-11-16 23:15:28,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5219 conditions, 3711 events. 861/3711 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 33481 event pairs, 242 based on Foata normal form. 1627/4679 useless extension candidates. Maximal degree in co-relation 5187. Up to 801 conditions per place. [2024-11-16 23:15:28,804 INFO L140 encePairwiseOnDemand]: 164/183 looper letters, 28 selfloop transitions, 8 changer transitions 0/153 dead transitions. [2024-11-16 23:15:28,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 153 transitions, 399 flow [2024-11-16 23:15:28,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:15:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:15:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2024-11-16 23:15:28,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8816029143897997 [2024-11-16 23:15:28,809 INFO L175 Difference]: Start difference. First operand has 157 places, 156 transitions, 325 flow. Second operand 3 states and 484 transitions. [2024-11-16 23:15:28,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 153 transitions, 399 flow [2024-11-16 23:15:28,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 153 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:15:28,815 INFO L231 Difference]: Finished difference. Result has 145 places, 145 transitions, 356 flow [2024-11-16 23:15:28,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=145, PETRI_TRANSITIONS=145} [2024-11-16 23:15:28,817 INFO L277 CegarLoopForPetriNet]: 157 programPoint places, -12 predicate places. [2024-11-16 23:15:28,819 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 145 transitions, 356 flow [2024-11-16 23:15:28,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-16 23:15:28,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:28,819 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] [2024-11-16 23:15:28,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:15:28,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-16 23:15:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 927820219, now seen corresponding path program 1 times [2024-11-16 23:15:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:28,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123572178] [2024-11-16 23:15:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:28,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:15:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:15:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:15:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123572178] [2024-11-16 23:15:28,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123572178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:15:28,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:15:28,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:15:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832469893] [2024-11-16 23:15:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:15:28,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:15:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:15:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:15:28,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:15:28,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 183 [2024-11-16 23:15:28,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 145 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-16 23:15:28,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:15:28,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 183 [2024-11-16 23:15:28,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:15:30,564 INFO L124 PetriNetUnfolderBase]: 2733/11402 cut-off events. [2024-11-16 23:15:30,565 INFO L125 PetriNetUnfolderBase]: For 718/721 co-relation queries the response was YES. [2024-11-16 23:15:30,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17255 conditions, 11402 events. 2733/11402 cut-off events. For 718/721 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 131420 event pairs, 711 based on Foata normal form. 0/9510 useless extension candidates. Maximal degree in co-relation 17222. Up to 2139 conditions per place. [2024-11-16 23:15:30,710 INFO L140 encePairwiseOnDemand]: 172/183 looper letters, 28 selfloop transitions, 8 changer transitions 0/161 dead transitions. [2024-11-16 23:15:30,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 161 transitions, 468 flow [2024-11-16 23:15:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:15:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:15:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2024-11-16 23:15:30,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8524590163934426 [2024-11-16 23:15:30,713 INFO L175 Difference]: Start difference. First operand has 145 places, 145 transitions, 356 flow. Second operand 3 states and 468 transitions. [2024-11-16 23:15:30,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 161 transitions, 468 flow [2024-11-16 23:15:30,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 161 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:15:30,727 INFO L231 Difference]: Finished difference. Result has 147 places, 153 transitions, 410 flow [2024-11-16 23:15:30,728 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=147, PETRI_TRANSITIONS=153} [2024-11-16 23:15:30,729 INFO L277 CegarLoopForPetriNet]: 157 programPoint places, -10 predicate places. [2024-11-16 23:15:30,730 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 153 transitions, 410 flow [2024-11-16 23:15:30,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-16 23:15:30,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:30,731 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, 1, 1] [2024-11-16 23:15:30,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:15:30,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-16 23:15:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1060654495, now seen corresponding path program 1 times [2024-11-16 23:15:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758576880] [2024-11-16 23:15:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:15:30,876 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-16 23:15:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:15:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758576880] [2024-11-16 23:15:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758576880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:15:30,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:15:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:15:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654669559] [2024-11-16 23:15:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:15:30,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:15:30,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:15:30,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:15:30,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:15:30,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 183 [2024-11-16 23:15:30,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 153 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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-16 23:15:30,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:15:30,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 183 [2024-11-16 23:15:30,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:15:32,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([469] L694-6-->L694-5: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][53], [177#true, Black: 190#true, 24#L708true, 179#true, 195#true, 61#L694-5true, 181#true, 138#L695-1true, 70#L717-1true, 192#(= |#race~b~0| 0), Black: 185#true]) [2024-11-16 23:15:32,582 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2024-11-16 23:15:32,583 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-16 23:15:32,583 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-16 23:15:32,583 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-11-16 23:15:32,876 INFO L124 PetriNetUnfolderBase]: 3513/14876 cut-off events. [2024-11-16 23:15:32,876 INFO L125 PetriNetUnfolderBase]: For 912/917 co-relation queries the response was YES. [2024-11-16 23:15:32,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23218 conditions, 14876 events. 3513/14876 cut-off events. For 912/917 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 180454 event pairs, 1504 based on Foata normal form. 0/12584 useless extension candidates. Maximal degree in co-relation 23184. Up to 3347 conditions per place. [2024-11-16 23:15:33,087 INFO L140 encePairwiseOnDemand]: 177/183 looper letters, 21 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2024-11-16 23:15:33,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 162 transitions, 485 flow [2024-11-16 23:15:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:15:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:15:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-11-16 23:15:33,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8633879781420765 [2024-11-16 23:15:33,089 INFO L175 Difference]: Start difference. First operand has 147 places, 153 transitions, 410 flow. Second operand 3 states and 474 transitions. [2024-11-16 23:15:33,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 162 transitions, 485 flow [2024-11-16 23:15:33,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 162 transitions, 469 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:15:33,102 INFO L231 Difference]: Finished difference. Result has 149 places, 157 transitions, 432 flow [2024-11-16 23:15:33,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=149, PETRI_TRANSITIONS=157} [2024-11-16 23:15:33,106 INFO L277 CegarLoopForPetriNet]: 157 programPoint places, -8 predicate places. [2024-11-16 23:15:33,106 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 157 transitions, 432 flow [2024-11-16 23:15:33,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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-16 23:15:33,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:33,107 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 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-16 23:15:33,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:15:33,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2024-11-16 23:15:33,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1757464106, now seen corresponding path program 1 times [2024-11-16 23:15:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738651523] [2024-11-16 23:15:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:15:33,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:15:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:15:33,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:15:33,157 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:15:33,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2024-11-16 23:15:33,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2024-11-16 23:15:33,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2024-11-16 23:15:33,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2024-11-16 23:15:33,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2024-11-16 23:15:33,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2024-11-16 23:15:33,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2024-11-16 23:15:33,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2024-11-16 23:15:33,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2024-11-16 23:15:33,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2024-11-16 23:15:33,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2024-11-16 23:15:33,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 32 remaining) [2024-11-16 23:15:33,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2024-11-16 23:15:33,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2024-11-16 23:15:33,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2024-11-16 23:15:33,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2024-11-16 23:15:33,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2024-11-16 23:15:33,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2024-11-16 23:15:33,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2024-11-16 23:15:33,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2024-11-16 23:15:33,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2024-11-16 23:15:33,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2024-11-16 23:15:33,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2024-11-16 23:15:33,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2024-11-16 23:15:33,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2024-11-16 23:15:33,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2024-11-16 23:15:33,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2024-11-16 23:15:33,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2024-11-16 23:15:33,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2024-11-16 23:15:33,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2024-11-16 23:15:33,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2024-11-16 23:15:33,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2024-11-16 23:15:33,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:15:33,349 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 23:15:33,350 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 23:15:33,350 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 23:15:33,403 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:15:33,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 255 transitions, 546 flow [2024-11-16 23:15:33,431 INFO L124 PetriNetUnfolderBase]: 11/236 cut-off events. [2024-11-16 23:15:33,431 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-16 23:15:33,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 236 events. 11/236 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 615 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 247. Up to 8 conditions per place. [2024-11-16 23:15:33,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 255 transitions, 546 flow [2024-11-16 23:15:33,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 202 transitions, 425 flow [2024-11-16 23:15:33,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:15:33,443 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;@50698f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:15:33,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-16 23:15:33,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:15:33,449 INFO L124 PetriNetUnfolderBase]: 2/46 cut-off events. [2024-11-16 23:15:33,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:15:33,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:33,449 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] [2024-11-16 23:15:33,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2024-11-16 23:15:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1903417816, now seen corresponding path program 1 times [2024-11-16 23:15:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61867574] [2024-11-16 23:15:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:15:33,487 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-16 23:15:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:15:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61867574] [2024-11-16 23:15:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61867574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:15:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:15:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:15:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216725689] [2024-11-16 23:15:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:15:33,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:15:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:15:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:15:33,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:15:33,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 255 [2024-11-16 23:15:33,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 202 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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-16 23:15:33,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:15:33,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 255 [2024-11-16 23:15:33,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:15:37,405 INFO L124 PetriNetUnfolderBase]: 10780/35160 cut-off events. [2024-11-16 23:15:37,406 INFO L125 PetriNetUnfolderBase]: For 2746/2746 co-relation queries the response was YES. [2024-11-16 23:15:37,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51771 conditions, 35160 events. 10780/35160 cut-off events. For 2746/2746 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 440672 event pairs, 3538 based on Foata normal form. 14384/42926 useless extension candidates. Maximal degree in co-relation 51738. Up to 8428 conditions per place. [2024-11-16 23:15:38,157 INFO L140 encePairwiseOnDemand]: 231/255 looper letters, 38 selfloop transitions, 11 changer transitions 0/202 dead transitions. [2024-11-16 23:15:38,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 202 transitions, 538 flow [2024-11-16 23:15:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:15:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:15:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2024-11-16 23:15:38,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8614379084967321 [2024-11-16 23:15:38,160 INFO L175 Difference]: Start difference. First operand has 204 places, 202 transitions, 425 flow. Second operand 3 states and 659 transitions. [2024-11-16 23:15:38,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 202 transitions, 538 flow [2024-11-16 23:15:38,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 202 transitions, 533 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-16 23:15:38,166 INFO L231 Difference]: Finished difference. Result has 189 places, 191 transitions, 474 flow [2024-11-16 23:15:38,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=189, PETRI_TRANSITIONS=191} [2024-11-16 23:15:38,167 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -15 predicate places. [2024-11-16 23:15:38,168 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 191 transitions, 474 flow [2024-11-16 23:15:38,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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-16 23:15:38,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:15:38,169 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] [2024-11-16 23:15:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:15:38,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2024-11-16 23:15:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:15:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -471520871, now seen corresponding path program 1 times [2024-11-16 23:15:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:15:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465234655] [2024-11-16 23:15:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:15:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:15:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:15:38,217 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-16 23:15:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:15:38,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465234655] [2024-11-16 23:15:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465234655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:15:38,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:15:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:15:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454344847] [2024-11-16 23:15:38,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:15:38,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:15:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:15:38,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:15:38,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:15:38,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 255 [2024-11-16 23:15:38,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 191 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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-16 23:15:38,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:15:38,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 255 [2024-11-16 23:15:38,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:15:52,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L695-2-->L695-1: Formula: (= |v_#race~a~0_3| |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_3|} AuxVars[] AssignedVars[#race~a~0][82], [42#L717-1true, 248#true, Black: 258#(= |#race~a~0| 0), 104#L694-4true, 250#true, 244#true, 133#L707-2true, 191#L695-1true, 246#true, 95#L694-4true, 263#(= |#race~b~0| 0), 256#true]) [2024-11-16 23:15:52,293 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:15:52,294 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-16 23:15:52,294 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:15:52,294 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:15:52,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L695-2-->L695-1: Formula: (= |v_#race~a~0_3| |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_3|} AuxVars[] AssignedVars[#race~a~0][82], [42#L717-1true, 248#true, Black: 258#(= |#race~a~0| 0), 104#L694-4true, 250#true, 244#true, 191#L695-1true, 246#true, 239#L707-1true, 95#L694-4true, 263#(= |#race~b~0| 0), 256#true]) [2024-11-16 23:15:52,576 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-16 23:15:52,576 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:15:52,576 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-16 23:15:52,576 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-16 23:15:53,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L695-2-->L695-1: Formula: (= |v_#race~a~0_3| |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_3|} AuxVars[] AssignedVars[#race~a~0][82], [42#L717-1true, 248#true, Black: 258#(= |#race~a~0| 0), 104#L694-4true, 175#L708true, 250#true, 244#true, 191#L695-1true, 246#true, 263#(= |#race~b~0| 0), 95#L694-4true, 256#true]) [2024-11-16 23:15:53,588 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-11-16 23:15:53,588 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-11-16 23:15:53,588 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-16 23:15:53,588 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2024-11-16 23:15:53,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([778] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][163], [106#L695-5true, 42#L717-1true, 248#true, Black: 256#true, 250#true, 244#true, 53#L695-5true, 149#L706true, 246#true, 95#L694-4true, 263#(= |#race~b~0| 0), 258#(= |#race~a~0| 0)]) [2024-11-16 23:15:53,907 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-16 23:15:53,907 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-16 23:15:53,907 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-16 23:15:53,907 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-16 23:15:54,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L695-2-->L695-1: Formula: (= |v_#race~a~0_3| |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_3|} AuxVars[] AssignedVars[#race~a~0][82], [42#L717-1true, 248#true, Black: 258#(= |#race~a~0| 0), 104#L694-4true, 250#true, 244#true, 191#L695-1true, 149#L706true, 246#true, 68#L694-5true, 263#(= |#race~b~0| 0), 256#true]) [2024-11-16 23:15:54,248 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-11-16 23:15:54,248 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-16 23:15:54,248 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:15:54,248 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-16 23:15:54,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L707-5-->L707-4: Formula: (= |v_#race~a~0_9| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_9|} AuxVars[] AssignedVars[#race~a~0][62], [42#L717-1true, 248#true, 106#L695-5true, Black: 256#true, 145#L707-4true, 104#L694-4true, 250#true, 244#true, 246#true, 263#(= |#race~b~0| 0), 95#L694-4true, 258#(= |#race~a~0| 0)]) [2024-11-16 23:15:54,249 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-11-16 23:15:54,249 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-16 23:15:54,249 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2024-11-16 23:15:54,249 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-16 23:15:54,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([778] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][163], [42#L717-1true, 248#true, Black: 256#true, 250#true, 244#true, 53#L695-5true, 149#L706true, 246#true, 263#(= |#race~b~0| 0), 95#L694-4true, 212#L695-4true, 258#(= |#race~a~0| 0)]) [2024-11-16 23:15:54,253 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-16 23:15:54,253 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-16 23:15:54,254 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-16 23:15:54,254 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-16 23:15:54,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L695-2-->L695-1: Formula: (= |v_#race~a~0_3| |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_3|} AuxVars[] AssignedVars[#race~a~0][82], [42#L717-1true, 248#true, Black: 258#(= |#race~a~0| 0), 104#L694-4true, 250#true, 244#true, 191#L695-1true, 149#L706true, 246#true, 263#(= |#race~b~0| 0), 95#L694-4true, 256#true]) [2024-11-16 23:15:54,574 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-11-16 23:15:54,574 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-16 23:15:54,574 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-16 23:15:54,574 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:15:55,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([693] L695-2-->L695-1: Formula: (= |v_#race~a~0_3| |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_3|} AuxVars[] AssignedVars[#race~a~0][82], [42#L717-1true, 248#true, Black: 258#(= |#race~a~0| 0), 250#true, 244#true, 191#L695-1true, 149#L706true, 246#true, 127#L694-5true, 95#L694-4true, 263#(= |#race~b~0| 0), 256#true]) [2024-11-16 23:15:55,235 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-11-16 23:15:55,235 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-16 23:15:55,235 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-11-16 23:15:55,235 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-16 23:15:55,235 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([693] L695-2-->L695-1: Formula: (= |v_#race~a~0_3| |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_3|} AuxVars[] AssignedVars[#race~a~0][82], [42#L717-1true, 248#true, Black: 258#(= |#race~a~0| 0), 104#L694-4true, 250#true, 244#true, 191#L695-1true, 149#L706true, 246#true, 95#L694-4true, 263#(= |#race~b~0| 0), 256#true]) [2024-11-16 23:15:55,235 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-11-16 23:15:55,235 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-16 23:15:55,235 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-11-16 23:15:55,236 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2024-11-16 23:15:55,236 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:15:55,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([778] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][163], [42#L717-1true, 248#true, Black: 256#true, 250#true, 244#true, 191#L695-1true, 53#L695-5true, 149#L706true, 246#true, 173#L695-4true, 263#(= |#race~b~0| 0), 258#(= |#race~a~0| 0)]) [2024-11-16 23:15:55,834 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-16 23:15:55,834 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-16 23:15:55,834 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-16 23:15:55,834 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-11-16 23:15:58,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L707-3-->L707-2: Formula: (= |v_#race~b~0_7| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_7|} AuxVars[] AssignedVars[#race~b~0][38], [42#L717-1true, 248#true, Black: 256#true, 140#L693true, 250#true, 244#true, 62#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 133#L707-2true, 246#true, 52#L695-1true, 263#(= |#race~b~0| 0), 258#(= |#race~a~0| 0)]) [2024-11-16 23:15:58,312 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-11-16 23:15:58,312 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-16 23:15:58,312 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-16 23:15:58,312 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L694-6-->L694-5: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][86], [42#L717-1true, 248#true, Black: 256#true, 250#true, 244#true, 62#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 246#true, 52#L695-1true, 68#L694-5true, 150#L707-3true, 258#(= |#race~a~0| 0), 261#true]) [2024-11-16 23:15:58,333 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L694-6-->L694-5: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][86], [42#L717-1true, 248#true, Black: 256#true, 145#L707-4true, 250#true, 244#true, 62#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 246#true, 52#L695-1true, 68#L694-5true, 261#true, 258#(= |#race~a~0| 0)]) [2024-11-16 23:15:58,333 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-16 23:15:58,333 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-11-16 23:15:58,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L707-3-->L707-2: Formula: (= |v_#race~b~0_7| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_7|} AuxVars[] AssignedVars[#race~b~0][69], [120#L698true, 42#L717-1true, 248#true, Black: 256#true, 179#L698true, 250#true, 244#true, 169#L695-1true, 133#L707-2true, 246#true, 263#(= |#race~b~0| 0), 258#(= |#race~a~0| 0)]) [2024-11-16 23:15:58,414 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-16 23:15:58,414 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-16 23:15:58,415 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-16 23:15:58,415 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-16 23:15:58,566 INFO L124 PetriNetUnfolderBase]: 53657/170736 cut-off events. [2024-11-16 23:15:58,566 INFO L125 PetriNetUnfolderBase]: For 11343/11517 co-relation queries the response was YES. [2024-11-16 23:15:59,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267967 conditions, 170736 events. 53657/170736 cut-off events. For 11343/11517 co-relation queries the response was YES. Maximal size of possible extension queue 4914. Compared 2664889 event pairs, 16321 based on Foata normal form. 0/141516 useless extension candidates. Maximal degree in co-relation 267933. Up to 36178 conditions per place. [2024-11-16 23:16:01,342 INFO L140 encePairwiseOnDemand]: 240/255 looper letters, 38 selfloop transitions, 11 changer transitions 0/213 dead transitions. [2024-11-16 23:16:01,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 213 transitions, 629 flow [2024-11-16 23:16:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:16:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:16:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2024-11-16 23:16:01,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8379084967320262 [2024-11-16 23:16:01,344 INFO L175 Difference]: Start difference. First operand has 189 places, 191 transitions, 474 flow. Second operand 3 states and 641 transitions. [2024-11-16 23:16:01,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 213 transitions, 629 flow [2024-11-16 23:16:01,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 213 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:16:01,432 INFO L231 Difference]: Finished difference. Result has 191 places, 202 transitions, 548 flow [2024-11-16 23:16:01,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=191, PETRI_TRANSITIONS=202} [2024-11-16 23:16:01,435 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -13 predicate places. [2024-11-16 23:16:01,436 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 202 transitions, 548 flow [2024-11-16 23:16:01,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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-16 23:16:01,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:16:01,437 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, 1, 1] [2024-11-16 23:16:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:16:01,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2024-11-16 23:16:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:16:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1029139500, now seen corresponding path program 1 times [2024-11-16 23:16:01,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:16:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822868583] [2024-11-16 23:16:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:16:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:16:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:16:01,490 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-16 23:16:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:16:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822868583] [2024-11-16 23:16:01,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822868583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:16:01,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:16:01,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:16:01,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596014636] [2024-11-16 23:16:01,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:16:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:16:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:16:01,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:16:01,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:16:01,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 255 [2024-11-16 23:16:01,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 202 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:16:01,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:16:01,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 255 [2024-11-16 23:16:01,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:16:11,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([679] L694-6-->L694-5: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][53], [42#L717-1true, Black: 256#true, 247#true, 250#true, 175#L708true, 244#true, 169#L695-1true, Black: 261#true, 266#true, 45#L694-5true, 246#true, 263#(= |#race~b~0| 0)]) [2024-11-16 23:16:11,058 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2024-11-16 23:16:11,058 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-16 23:16:11,058 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-11-16 23:16:11,058 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-11-16 23:16:17,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L694-6-->L694-5: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][71], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 266#true, 246#true, 52#L695-1true, 263#(= |#race~b~0| 0), 250#true, 175#L708true, 244#true, 68#L694-5true, 55#thr2ENTRYtrue]) [2024-11-16 23:16:17,582 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-16 23:16:17,582 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:16:17,582 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-16 23:16:17,582 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-16 23:16:19,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 266#true, 239#L707-1true, 246#true, 263#(= |#race~b~0| 0), 146#L695-5true, 106#L695-5true, 250#true, 244#true, 184#L693true]) [2024-11-16 23:16:19,482 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:16:19,482 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-16 23:16:19,482 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:16:19,482 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-16 23:16:19,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 133#L707-2true, 266#true, 246#true, 263#(= |#race~b~0| 0), 146#L695-5true, 106#L695-5true, 250#true, 244#true, 184#L693true]) [2024-11-16 23:16:19,482 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-16 23:16:19,482 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-16 23:16:19,482 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-16 23:16:19,482 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-16 23:16:20,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L708-3-->L708: 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][48], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 53#L695-5true, 266#true, 246#true, 263#(= |#race~b~0| 0), 250#true, 175#L708true, 244#true, 128#L694-1true, 89#L693true]) [2024-11-16 23:16:20,458 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-16 23:16:20,458 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-11-16 23:16:20,458 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-16 23:16:20,459 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-16 23:16:20,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 133#L707-2true, 266#true, 246#true, 263#(= |#race~b~0| 0), 146#L695-5true, 250#true, 244#true, 184#L693true, 212#L695-4true]) [2024-11-16 23:16:20,670 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:16:20,670 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-16 23:16:20,670 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:16:20,670 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-16 23:16:20,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 266#true, 239#L707-1true, 246#true, 263#(= |#race~b~0| 0), 146#L695-5true, 250#true, 244#true, 184#L693true, 212#L695-4true]) [2024-11-16 23:16:20,670 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-16 23:16:20,670 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-16 23:16:20,671 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:16:20,671 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:16:20,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([724] L694-6-->L694-5: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][71], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 266#true, 246#true, 87#L694-2true, 52#L695-1true, 263#(= |#race~b~0| 0), 250#true, 175#L708true, 244#true, 68#L694-5true]) [2024-11-16 23:16:20,983 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-11-16 23:16:20,983 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-16 23:16:20,983 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-16 23:16:20,983 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-16 23:16:21,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 133#L707-2true, 53#L695-5true, 108#L697-5true, 266#true, 246#true, 263#(= |#race~b~0| 0), 146#L695-5true, 250#true, 244#true]) [2024-11-16 23:16:21,422 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:16:21,422 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-16 23:16:21,422 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-16 23:16:21,422 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-16 23:16:21,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, 6#L695-4true, Black: 261#true, 133#L707-2true, 266#true, 246#true, 263#(= |#race~b~0| 0), 146#L695-5true, 250#true, 244#true, 89#L693true]) [2024-11-16 23:16:21,738 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 53#L695-5true, 266#true, 246#true, 239#L707-1true, 263#(= |#race~b~0| 0), 146#L695-5true, 250#true, 244#true, 89#L693true]) [2024-11-16 23:16:21,738 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 6#L695-4true, 266#true, 246#true, 239#L707-1true, 263#(= |#race~b~0| 0), 146#L695-5true, 250#true, 244#true, 89#L693true]) [2024-11-16 23:16:21,738 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-16 23:16:21,738 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-16 23:16:21,739 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-16 23:16:21,739 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-16 23:16:21,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L695-6-->L695-5: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][127], [42#L717-1true, 248#true, Black: 256#true, Black: 261#true, 133#L707-2true, 53#L695-5true, 266#true, 246#true, 263#(= |#race~b~0| 0), 146#L695-5true, 250#true, 244#true, 89#L693true]) [2024-11-16 23:16:21,739 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-11-16 23:16:21,739 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2024-11-16 23:16:21,739 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2024-11-16 23:16:21,739 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event