./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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/14_spin2003.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 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:29:44,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:29:44,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:29:44,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:29:44,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:29:44,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:29:44,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:29:44,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:29:44,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:29:44,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:29:44,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:29:44,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:29:44,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:29:44,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:29:44,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:29:44,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:29:44,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:29:44,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:29:44,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:29:44,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:29:44,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:29:44,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:29:44,609 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:29:44,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:29:44,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:29:44,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:29:44,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:29:44,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:29:44,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:29:44,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:29:44,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:29:44,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:29:44,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:29:44,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:29:44,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:29:44,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:29:44,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:29:44,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:29:44,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:29:44,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:29:44,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:29:44,614 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 -> 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 [2024-11-19 05:29:44,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:29:44,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:29:44,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:29:44,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:29:44,912 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:29:44,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-11-19 05:29:46,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:29:46,707 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:29:46,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-11-19 05:29:46,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f02cb6cf/4f28b858ba5143208619906bbc745bc8/FLAGe7eebd225 [2024-11-19 05:29:46,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f02cb6cf/4f28b858ba5143208619906bbc745bc8 [2024-11-19 05:29:46,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:29:46,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:29:46,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:29:46,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:29:46,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:29:46,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:29:46" (1/1) ... [2024-11-19 05:29:46,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fa234c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:46, skipping insertion in model container [2024-11-19 05:29:46,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:29:46" (1/1) ... [2024-11-19 05:29:46,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:29:47,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:29:47,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:29:47,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:29:47,299 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:29:47,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47 WrapperNode [2024-11-19 05:29:47,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:29:47,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:29:47,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:29:47,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:29:47,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,357 INFO L138 Inliner]: procedures = 161, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2024-11-19 05:29:47,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:29:47,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:29:47,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:29:47,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:29:47,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:29:47,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:29:47,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:29:47,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:29:47,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (1/1) ... [2024-11-19 05:29:47,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:29:47,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:29:47,423 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-19 05:29:47,426 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-19 05:29:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-19 05:29:47,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-19 05:29:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:29:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:29:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:29:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:29:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:29:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:29:47,482 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:29:47,612 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:29:47,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:29:47,717 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:29:47,717 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:29:47,742 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:29:47,743 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 05:29:47,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:29:47 BoogieIcfgContainer [2024-11-19 05:29:47,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:29:47,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:29:47,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:29:47,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:29:47,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:29:46" (1/3) ... [2024-11-19 05:29:47,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cf1b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:29:47, skipping insertion in model container [2024-11-19 05:29:47,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:29:47" (2/3) ... [2024-11-19 05:29:47,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cf1b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:29:47, skipping insertion in model container [2024-11-19 05:29:47,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:29:47" (3/3) ... [2024-11-19 05:29:47,753 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2024-11-19 05:29:47,770 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:29:47,771 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 05:29:47,771 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:29:47,812 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 05:29:47,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 120 flow [2024-11-19 05:29:47,883 INFO L124 PetriNetUnfolderBase]: 4/67 cut-off events. [2024-11-19 05:29:47,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:29:47,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 67 events. 4/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2024-11-19 05:29:47,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 58 transitions, 120 flow [2024-11-19 05:29:47,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 58 transitions, 120 flow [2024-11-19 05:29:47,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:29:47,912 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;@1375520a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:29:47,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 05:29:47,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:29:47,932 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-19 05:29:47,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:29:47,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:47,933 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:29:47,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 05:29:47,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1041533827, now seen corresponding path program 1 times [2024-11-19 05:29:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552076912] [2024-11-19 05:29:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:29:48,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:29:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:29:48,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:29:48,144 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:29:48,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-19 05:29:48,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-19 05:29:48,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-19 05:29:48,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-19 05:29:48,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-19 05:29:48,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-19 05:29:48,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-19 05:29:48,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:29:48,149 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-19 05:29:48,153 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:29:48,154 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:29:48,187 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 05:29:48,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 89 transitions, 188 flow [2024-11-19 05:29:48,222 INFO L124 PetriNetUnfolderBase]: 7/107 cut-off events. [2024-11-19 05:29:48,223 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:29:48,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 107 events. 7/107 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 169 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 69. Up to 6 conditions per place. [2024-11-19 05:29:48,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 89 transitions, 188 flow [2024-11-19 05:29:48,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 89 transitions, 188 flow [2024-11-19 05:29:48,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:29:48,233 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;@1375520a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:29:48,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-19 05:29:48,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:29:48,263 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-11-19 05:29:48,263 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:29:48,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:48,263 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] [2024-11-19 05:29:48,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-19 05:29:48,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1753087482, now seen corresponding path program 1 times [2024-11-19 05:29:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572006695] [2024-11-19 05:29:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:29:48,405 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-19 05:29:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:29:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572006695] [2024-11-19 05:29:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572006695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:29:48,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:29:48,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:29:48,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197349408] [2024-11-19 05:29:48,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:29:48,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:29:48,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:29:48,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:29:48,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:29:48,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 89 [2024-11-19 05:29:48,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-19 05:29:48,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:29:48,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 89 [2024-11-19 05:29:48,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:29:48,647 INFO L124 PetriNetUnfolderBase]: 57/330 cut-off events. [2024-11-19 05:29:48,647 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-19 05:29:48,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 330 events. 57/330 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1645 event pairs, 37 based on Foata normal form. 110/395 useless extension candidates. Maximal degree in co-relation 384. Up to 109 conditions per place. [2024-11-19 05:29:48,655 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 18 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2024-11-19 05:29:48,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 231 flow [2024-11-19 05:29:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:29:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:29:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-11-19 05:29:48,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8614232209737828 [2024-11-19 05:29:48,671 INFO L175 Difference]: Start difference. First operand has 89 places, 89 transitions, 188 flow. Second operand 3 states and 230 transitions. [2024-11-19 05:29:48,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 231 flow [2024-11-19 05:29:48,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 84 transitions, 231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:29:48,677 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 208 flow [2024-11-19 05:29:48,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2024-11-19 05:29:48,685 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -4 predicate places. [2024-11-19 05:29:48,687 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 208 flow [2024-11-19 05:29:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-19 05:29:48,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:48,687 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:29:48,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:29:48,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-11-19 05:29:48,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1093716769, now seen corresponding path program 1 times [2024-11-19 05:29:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921476262] [2024-11-19 05:29:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:29:48,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:29:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:29:48,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:29:48,755 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:29:48,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-19 05:29:48,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-19 05:29:48,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-19 05:29:48,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-19 05:29:48,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-19 05:29:48,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-19 05:29:48,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-19 05:29:48,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-19 05:29:48,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-19 05:29:48,760 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-19 05:29:48,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:29:48,760 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 05:29:48,761 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:29:48,761 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 05:29:48,789 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 05:29:48,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow [2024-11-19 05:29:48,817 INFO L124 PetriNetUnfolderBase]: 10/147 cut-off events. [2024-11-19 05:29:48,818 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 05:29:48,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 10/147 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 356 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 111. Up to 8 conditions per place. [2024-11-19 05:29:48,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 120 transitions, 258 flow [2024-11-19 05:29:48,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 120 transitions, 258 flow [2024-11-19 05:29:48,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:29:48,823 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;@1375520a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:29:48,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-19 05:29:48,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:29:48,829 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-11-19 05:29:48,829 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:29:48,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:48,829 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] [2024-11-19 05:29:48,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-19 05:29:48,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash -963120480, now seen corresponding path program 1 times [2024-11-19 05:29:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629222842] [2024-11-19 05:29:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:29:48,916 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-19 05:29:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:29:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629222842] [2024-11-19 05:29:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629222842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:29:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:29:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:29:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731815167] [2024-11-19 05:29:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:29:48,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:29:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:29:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:29:48,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:29:48,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 120 [2024-11-19 05:29:48,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-19 05:29:48,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:29:48,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 120 [2024-11-19 05:29:48,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:29:49,440 INFO L124 PetriNetUnfolderBase]: 783/2699 cut-off events. [2024-11-19 05:29:49,441 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2024-11-19 05:29:49,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 2699 events. 783/2699 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 23577 event pairs, 556 based on Foata normal form. 841/3132 useless extension candidates. Maximal degree in co-relation 3385. Up to 1091 conditions per place. [2024-11-19 05:29:49,471 INFO L140 encePairwiseOnDemand]: 102/120 looper letters, 27 selfloop transitions, 9 changer transitions 0/117 dead transitions. [2024-11-19 05:29:49,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 117 transitions, 336 flow [2024-11-19 05:29:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:29:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:29:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2024-11-19 05:29:49,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2024-11-19 05:29:49,475 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 258 flow. Second operand 3 states and 312 transitions. [2024-11-19 05:29:49,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 117 transitions, 336 flow [2024-11-19 05:29:49,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 117 transitions, 332 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-19 05:29:49,483 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 292 flow [2024-11-19 05:29:49,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2024-11-19 05:29:49,485 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -6 predicate places. [2024-11-19 05:29:49,485 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 292 flow [2024-11-19 05:29:49,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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-19 05:29:49,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:49,486 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:29:49,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:29:49,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-19 05:29:49,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash 362993991, now seen corresponding path program 1 times [2024-11-19 05:29:49,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:49,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907529534] [2024-11-19 05:29:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:49,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:29:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 05:29:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:29:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907529534] [2024-11-19 05:29:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907529534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:29:49,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:29:49,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:29:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489562201] [2024-11-19 05:29:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:29:49,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:29:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:29:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:29:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:29:49,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 120 [2024-11-19 05:29:49,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-19 05:29:49,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:29:49,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 120 [2024-11-19 05:29:49,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:29:50,136 INFO L124 PetriNetUnfolderBase]: 1174/3585 cut-off events. [2024-11-19 05:29:50,138 INFO L125 PetriNetUnfolderBase]: For 1102/1138 co-relation queries the response was YES. [2024-11-19 05:29:50,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6860 conditions, 3585 events. 1174/3585 cut-off events. For 1102/1138 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 32180 event pairs, 676 based on Foata normal form. 0/3073 useless extension candidates. Maximal degree in co-relation 6759. Up to 1505 conditions per place. [2024-11-19 05:29:50,177 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 31 selfloop transitions, 13 changer transitions 0/127 dead transitions. [2024-11-19 05:29:50,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 127 transitions, 439 flow [2024-11-19 05:29:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:29:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:29:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-11-19 05:29:50,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.825 [2024-11-19 05:29:50,181 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 292 flow. Second operand 3 states and 297 transitions. [2024-11-19 05:29:50,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 127 transitions, 439 flow [2024-11-19 05:29:50,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:29:50,196 INFO L231 Difference]: Finished difference. Result has 116 places, 122 transitions, 386 flow [2024-11-19 05:29:50,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=116, PETRI_TRANSITIONS=122} [2024-11-19 05:29:50,198 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -4 predicate places. [2024-11-19 05:29:50,199 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 122 transitions, 386 flow [2024-11-19 05:29:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-19 05:29:50,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:50,199 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] [2024-11-19 05:29:50,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:29:50,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-19 05:29:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -581048635, now seen corresponding path program 1 times [2024-11-19 05:29:50,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:50,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164674730] [2024-11-19 05:29:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:50,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:29:50,256 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-19 05:29:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:29:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164674730] [2024-11-19 05:29:50,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164674730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:29:50,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:29:50,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:29:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273337936] [2024-11-19 05:29:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:29:50,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:29:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:29:50,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:29:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:29:50,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 120 [2024-11-19 05:29:50,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 122 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-19 05:29:50,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:29:50,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 120 [2024-11-19 05:29:50,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:29:50,992 INFO L124 PetriNetUnfolderBase]: 1507/4615 cut-off events. [2024-11-19 05:29:50,993 INFO L125 PetriNetUnfolderBase]: For 2904/2996 co-relation queries the response was YES. [2024-11-19 05:29:51,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9845 conditions, 4615 events. 1507/4615 cut-off events. For 2904/2996 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 43977 event pairs, 764 based on Foata normal form. 2/3927 useless extension candidates. Maximal degree in co-relation 9725. Up to 1849 conditions per place. [2024-11-19 05:29:51,052 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 41 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2024-11-19 05:29:51,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 139 transitions, 578 flow [2024-11-19 05:29:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:29:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:29:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-11-19 05:29:51,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8277777777777777 [2024-11-19 05:29:51,057 INFO L175 Difference]: Start difference. First operand has 116 places, 122 transitions, 386 flow. Second operand 3 states and 298 transitions. [2024-11-19 05:29:51,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 139 transitions, 578 flow [2024-11-19 05:29:51,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:29:51,068 INFO L231 Difference]: Finished difference. Result has 118 places, 133 transitions, 490 flow [2024-11-19 05:29:51,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=118, PETRI_TRANSITIONS=133} [2024-11-19 05:29:51,071 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -2 predicate places. [2024-11-19 05:29:51,071 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 133 transitions, 490 flow [2024-11-19 05:29:51,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-19 05:29:51,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:51,072 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:29:51,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:29:51,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-11-19 05:29:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 244078707, now seen corresponding path program 1 times [2024-11-19 05:29:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117328384] [2024-11-19 05:29:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:29:51,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:29:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:29:51,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:29:51,117 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:29:51,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-11-19 05:29:51,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-19 05:29:51,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-19 05:29:51,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-19 05:29:51,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-19 05:29:51,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-19 05:29:51,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-19 05:29:51,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-11-19 05:29:51,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-19 05:29:51,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-19 05:29:51,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-19 05:29:51,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-19 05:29:51,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-19 05:29:51,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:29:51,121 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 05:29:51,122 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:29:51,122 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-19 05:29:51,161 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 05:29:51,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 151 transitions, 330 flow [2024-11-19 05:29:51,193 INFO L124 PetriNetUnfolderBase]: 13/187 cut-off events. [2024-11-19 05:29:51,193 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 05:29:51,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 187 events. 13/187 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 513 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 155. Up to 10 conditions per place. [2024-11-19 05:29:51,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 151 transitions, 330 flow [2024-11-19 05:29:51,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 151 transitions, 330 flow [2024-11-19 05:29:51,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:29:51,199 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;@1375520a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:29:51,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 05:29:51,207 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:29:51,207 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-19 05:29:51,207 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:29:51,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:51,208 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] [2024-11-19 05:29:51,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 05:29:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1425126921, now seen corresponding path program 1 times [2024-11-19 05:29:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:51,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250840170] [2024-11-19 05:29:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:29:51,252 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-19 05:29:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:29:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250840170] [2024-11-19 05:29:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250840170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:29:51,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:29:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:29:51,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103989647] [2024-11-19 05:29:51,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:29:51,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:29:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:29:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:29:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:29:51,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 151 [2024-11-19 05:29:51,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 151 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-19 05:29:51,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:29:51,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 151 [2024-11-19 05:29:51,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:29:53,719 INFO L124 PetriNetUnfolderBase]: 7395/19558 cut-off events. [2024-11-19 05:29:53,720 INFO L125 PetriNetUnfolderBase]: For 4630/4630 co-relation queries the response was YES. [2024-11-19 05:29:54,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32415 conditions, 19558 events. 7395/19558 cut-off events. For 4630/4630 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 217009 event pairs, 5488 based on Foata normal form. 6072/22839 useless extension candidates. Maximal degree in co-relation 25202. Up to 9127 conditions per place. [2024-11-19 05:29:54,124 INFO L140 encePairwiseOnDemand]: 128/151 looper letters, 36 selfloop transitions, 12 changer transitions 0/150 dead transitions. [2024-11-19 05:29:54,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 150 transitions, 445 flow [2024-11-19 05:29:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:29:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:29:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-11-19 05:29:54,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.869757174392936 [2024-11-19 05:29:54,127 INFO L175 Difference]: Start difference. First operand has 151 places, 151 transitions, 330 flow. Second operand 3 states and 394 transitions. [2024-11-19 05:29:54,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 150 transitions, 445 flow [2024-11-19 05:29:54,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 150 transitions, 433 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-19 05:29:54,133 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 376 flow [2024-11-19 05:29:54,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2024-11-19 05:29:54,135 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, -8 predicate places. [2024-11-19 05:29:54,135 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 376 flow [2024-11-19 05:29:54,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-19 05:29:54,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:54,137 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:29:54,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:29:54,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 05:29:54,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:54,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1158515781, now seen corresponding path program 1 times [2024-11-19 05:29:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245580010] [2024-11-19 05:29:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:54,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:29:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 05:29:54,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:29:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245580010] [2024-11-19 05:29:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245580010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:29:54,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:29:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:29:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612582858] [2024-11-19 05:29:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:29:54,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:29:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:29:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:29:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:29:54,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 151 [2024-11-19 05:29:54,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-19 05:29:54,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:29:54,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 151 [2024-11-19 05:29:54,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:29:57,076 INFO L124 PetriNetUnfolderBase]: 11950/29333 cut-off events. [2024-11-19 05:29:57,076 INFO L125 PetriNetUnfolderBase]: For 10091/10907 co-relation queries the response was YES. [2024-11-19 05:29:57,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58373 conditions, 29333 events. 11950/29333 cut-off events. For 10091/10907 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 332562 event pairs, 7318 based on Foata normal form. 15/25142 useless extension candidates. Maximal degree in co-relation 58268. Up to 13830 conditions per place. [2024-11-19 05:29:57,411 INFO L140 encePairwiseOnDemand]: 138/151 looper letters, 43 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2024-11-19 05:29:57,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 166 transitions, 600 flow [2024-11-19 05:29:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:29:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:29:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2024-11-19 05:29:57,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8278145695364238 [2024-11-19 05:29:57,414 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 376 flow. Second operand 3 states and 375 transitions. [2024-11-19 05:29:57,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 166 transitions, 600 flow [2024-11-19 05:29:57,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 166 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:29:57,494 INFO L231 Difference]: Finished difference. Result has 145 places, 158 transitions, 524 flow [2024-11-19 05:29:57,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=145, PETRI_TRANSITIONS=158} [2024-11-19 05:29:57,495 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, -6 predicate places. [2024-11-19 05:29:57,495 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 158 transitions, 524 flow [2024-11-19 05:29:57,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-19 05:29:57,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:29:57,496 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] [2024-11-19 05:29:57,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:29:57,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 05:29:57,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:29:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1728524611, now seen corresponding path program 1 times [2024-11-19 05:29:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:29:57,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511634385] [2024-11-19 05:29:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:29:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:29:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:29:57,542 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-19 05:29:57,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:29:57,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511634385] [2024-11-19 05:29:57,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511634385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:29:57,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:29:57,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:29:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347908501] [2024-11-19 05:29:57,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:29:57,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:29:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:29:57,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:29:57,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:29:57,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 151 [2024-11-19 05:29:57,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 158 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-19 05:29:57,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:29:57,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 151 [2024-11-19 05:29:57,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:30:01,104 INFO L124 PetriNetUnfolderBase]: 15833/38717 cut-off events. [2024-11-19 05:30:01,105 INFO L125 PetriNetUnfolderBase]: For 28695/30661 co-relation queries the response was YES. [2024-11-19 05:30:01,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87794 conditions, 38717 events. 15833/38717 cut-off events. For 28695/30661 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 456604 event pairs, 8854 based on Foata normal form. 27/32660 useless extension candidates. Maximal degree in co-relation 87669. Up to 17881 conditions per place. [2024-11-19 05:30:01,897 INFO L140 encePairwiseOnDemand]: 138/151 looper letters, 59 selfloop transitions, 19 changer transitions 0/184 dead transitions. [2024-11-19 05:30:01,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 184 transitions, 817 flow [2024-11-19 05:30:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:30:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:30:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2024-11-19 05:30:01,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8300220750551877 [2024-11-19 05:30:01,900 INFO L175 Difference]: Start difference. First operand has 145 places, 158 transitions, 524 flow. Second operand 3 states and 376 transitions. [2024-11-19 05:30:01,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 184 transitions, 817 flow [2024-11-19 05:30:02,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 184 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:30:02,017 INFO L231 Difference]: Finished difference. Result has 147 places, 175 transitions, 688 flow [2024-11-19 05:30:02,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=147, PETRI_TRANSITIONS=175} [2024-11-19 05:30:02,021 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, -4 predicate places. [2024-11-19 05:30:02,021 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 175 transitions, 688 flow [2024-11-19 05:30:02,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-19 05:30:02,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:30:02,022 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] [2024-11-19 05:30:02,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:30:02,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 05:30:02,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:30:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2114375356, now seen corresponding path program 1 times [2024-11-19 05:30:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:30:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802830780] [2024-11-19 05:30:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:30:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:30:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:30:02,061 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-19 05:30:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:30:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802830780] [2024-11-19 05:30:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802830780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:30:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:30:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:30:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141143532] [2024-11-19 05:30:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:30:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:30:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:30:02,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:30:02,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:30:02,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 151 [2024-11-19 05:30:02,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 175 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-19 05:30:02,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:30:02,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 151 [2024-11-19 05:30:02,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:30:11,659 INFO L124 PetriNetUnfolderBase]: 41999/99796 cut-off events. [2024-11-19 05:30:11,660 INFO L125 PetriNetUnfolderBase]: For 133846/138666 co-relation queries the response was YES. [2024-11-19 05:30:12,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250541 conditions, 99796 events. 41999/99796 cut-off events. For 133846/138666 co-relation queries the response was YES. Maximal size of possible extension queue 3455. Compared 1298585 event pairs, 10284 based on Foata normal form. 123/82824 useless extension candidates. Maximal degree in co-relation 250412. Up to 27442 conditions per place. [2024-11-19 05:30:13,259 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 82 selfloop transitions, 55 changer transitions 0/241 dead transitions. [2024-11-19 05:30:13,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 241 transitions, 1391 flow [2024-11-19 05:30:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:30:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:30:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2024-11-19 05:30:13,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8344370860927153 [2024-11-19 05:30:13,261 INFO L175 Difference]: Start difference. First operand has 147 places, 175 transitions, 688 flow. Second operand 3 states and 378 transitions. [2024-11-19 05:30:13,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 241 transitions, 1391 flow [2024-11-19 05:30:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 241 transitions, 1259 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-11-19 05:30:13,956 INFO L231 Difference]: Finished difference. Result has 149 places, 230 transitions, 1286 flow [2024-11-19 05:30:13,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1286, PETRI_PLACES=149, PETRI_TRANSITIONS=230} [2024-11-19 05:30:13,957 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, -2 predicate places. [2024-11-19 05:30:13,958 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 230 transitions, 1286 flow [2024-11-19 05:30:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-19 05:30:13,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:30:13,958 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 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-19 05:30:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:30:13,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 05:30:13,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:30:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2060518170, now seen corresponding path program 1 times [2024-11-19 05:30:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:30:13,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042519647] [2024-11-19 05:30:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:30:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:30:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:30:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 05:30:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:30:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042519647] [2024-11-19 05:30:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042519647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:30:14,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:30:14,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:30:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829184730] [2024-11-19 05:30:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:30:14,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:30:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:30:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:30:14,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:30:14,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 151 [2024-11-19 05:30:14,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 230 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-19 05:30:14,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:30:14,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 151 [2024-11-19 05:30:14,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:30:19,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][282], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, 17#L691-2true, 169#true, 7#L690-3true, 127#L689-4true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:19,563 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,563 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,564 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,564 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][281], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, 152#true, Black: 171#(= |#race~x~0| 0), 174#true, 95#L690-3true, 150#true, 146#true, 17#L691-2true, 169#true, 127#L689-4true, 121#L698-6true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-19 05:30:19,567 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,567 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,567 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,567 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][280], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 164#true, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, 17#L691-2true, 35#L690-3true, 169#true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:19,585 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,585 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,585 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:19,585 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:20,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][91], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 47#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 95#L690-3true, 150#true, 146#true, 169#true, 127#L689-4true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:20,918 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:20,918 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:20,918 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:20,918 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:22,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][292], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, 152#true, 174#true, Black: 169#true, 150#true, 146#true, 171#(= |#race~x~0| 0), 17#L691-2true, 144#L691-1true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:22,367 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-19 05:30:22,368 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:22,368 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:22,368 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:22,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][294], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, 109#L690-4true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, 17#L691-2true, 169#true, 7#L690-3true, 121#L698-6true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-19 05:30:22,450 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-19 05:30:22,450 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:22,450 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:22,450 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:22,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][293], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, 109#L690-4true, Black: 171#(= |#race~x~0| 0), 152#true, 95#L690-3true, 174#true, 150#true, 146#true, 17#L691-2true, 169#true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:22,485 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-19 05:30:22,486 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:22,486 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:22,486 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:24,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][159], [130#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 95#L690-3true, 174#true, 150#true, 146#true, 17#L691-2true, 169#true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:24,343 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2024-11-19 05:30:24,343 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-19 05:30:24,343 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-19 05:30:24,343 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2024-11-19 05:30:24,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][159], [130#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 148#true, 152#true, Black: 171#(= |#race~x~0| 0), 174#true, 95#L690-3true, 150#true, 146#true, 169#true, 121#L698-6true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-19 05:30:24,687 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-11-19 05:30:24,687 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-19 05:30:24,687 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-19 05:30:24,687 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-11-19 05:30:25,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][196], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 3#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 63#L691-2true, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, 17#L691-2true, 169#true, 7#L690-3true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:25,464 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-19 05:30:25,464 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-19 05:30:25,464 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-19 05:30:25,464 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-19 05:30:25,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 164#true, 102#L691-2true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, 17#L691-2true, 35#L690-3true, 169#true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:25,493 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2024-11-19 05:30:25,493 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-19 05:30:25,493 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-19 05:30:25,493 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2024-11-19 05:30:26,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][197], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 102#L691-2true, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 148#true, 152#true, 174#true, Black: 169#true, 150#true, 146#true, 171#(= |#race~x~0| 0), 17#L691-2true, 144#L691-1true, 121#L698-6true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-19 05:30:26,586 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-11-19 05:30:26,586 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-19 05:30:26,587 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-19 05:30:26,587 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-19 05:30:28,688 INFO L124 PetriNetUnfolderBase]: 61231/141173 cut-off events. [2024-11-19 05:30:28,688 INFO L125 PetriNetUnfolderBase]: For 375856/389424 co-relation queries the response was YES. [2024-11-19 05:30:29,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420768 conditions, 141173 events. 61231/141173 cut-off events. For 375856/389424 co-relation queries the response was YES. Maximal size of possible extension queue 4803. Compared 1878174 event pairs, 17744 based on Foata normal form. 177/117477 useless extension candidates. Maximal degree in co-relation 420646. Up to 63053 conditions per place. [2024-11-19 05:30:30,293 INFO L140 encePairwiseOnDemand]: 138/151 looper letters, 113 selfloop transitions, 74 changer transitions 0/299 dead transitions. [2024-11-19 05:30:30,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 299 transitions, 2225 flow [2024-11-19 05:30:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:30:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:30:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-19 05:30:30,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.82560706401766 [2024-11-19 05:30:30,295 INFO L175 Difference]: Start difference. First operand has 149 places, 230 transitions, 1286 flow. Second operand 3 states and 374 transitions. [2024-11-19 05:30:30,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 299 transitions, 2225 flow [2024-11-19 05:30:31,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 299 transitions, 2057 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:30:31,447 INFO L231 Difference]: Finished difference. Result has 151 places, 292 transitions, 2086 flow [2024-11-19 05:30:31,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=151, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=151, PETRI_TRANSITIONS=292} [2024-11-19 05:30:31,448 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 0 predicate places. [2024-11-19 05:30:31,449 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 292 transitions, 2086 flow [2024-11-19 05:30:31,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-19 05:30:31,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:30:31,449 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:30:31,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:30:31,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2024-11-19 05:30:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:30:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1527777363, now seen corresponding path program 1 times [2024-11-19 05:30:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:30:31,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945372123] [2024-11-19 05:30:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:30:31,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:30:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:30:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 05:30:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:30:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945372123] [2024-11-19 05:30:31,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945372123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:30:31,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:30:31,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:30:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352117360] [2024-11-19 05:30:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:30:31,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:30:31,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:30:31,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:30:31,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:30:31,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 151 [2024-11-19 05:30:31,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 292 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-19 05:30:31,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:30:31,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 151 [2024-11-19 05:30:31,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:30:37,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][329], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, 17#L691-2true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 179#true, 7#L690-3true, 127#L689-4true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:37,802 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:37,802 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:37,802 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:37,802 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:37,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][327], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 164#true, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 17#L691-2true, 179#true, 35#L690-3true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:37,820 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:37,820 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:37,820 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:37,820 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:38,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][329], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 179#true, 7#L690-3true, 127#L689-4true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:38,254 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-19 05:30:38,254 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-19 05:30:38,254 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-19 05:30:38,254 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-19 05:30:39,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][327], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 9#L692-2true, 83#L689-4true, Black: 164#true, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 179#true, 35#L690-3true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:39,082 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2024-11-19 05:30:39,082 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-19 05:30:39,082 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-19 05:30:39,082 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-11-19 05:30:39,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][330], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 95#L690-3true, 150#true, 146#true, 17#L691-2true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 181#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet3#1|), 127#L689-4true, 121#L698-6true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2024-11-19 05:30:39,118 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,118 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,118 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,118 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][90], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 164#true, 47#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 148#true, 152#true, Black: 171#(= |#race~x~0| 0), 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 179#true, 35#L690-3true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:39,555 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,555 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,555 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,555 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([602] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][107], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 47#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 6#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 95#L690-3true, 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 181#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet3#1|), 127#L689-4true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:39,670 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,670 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,670 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:39,670 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-19 05:30:41,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][343], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, 152#true, 174#true, Black: 169#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 17#L691-2true, 179#true, 144#L691-1true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:41,089 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,089 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,089 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,089 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][346], [75#L689-4true, Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, 109#L690-4true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 17#L691-2true, 179#true, 7#L690-3true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:41,187 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,187 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,187 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,187 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L691-->L691-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][344], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 148#true, 91#L691-1true, 152#true, Black: 169#true, 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 17#L691-2true, 179#true, 127#L689-4true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:41,297 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,297 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,297 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,297 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-11-19 05:30:41,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L690-2-->L690-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][348], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 166#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 80#L690-4true, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 17#L691-2true, 179#true, 7#L690-3true, 127#L689-4true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:41,387 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,387 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,387 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,387 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L690-2-->L690-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][347], [Black: 161#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 83#L689-4true, Black: 164#true, 80#L690-4true, 148#true, Black: 171#(= |#race~x~0| 0), 152#true, 174#true, 150#true, 146#true, 17#L691-2true, Black: 176#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 179#true, 35#L690-3true, Black: 156#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L698-6true]) [2024-11-19 05:30:41,419 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,419 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,419 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2024-11-19 05:30:41,419 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event