./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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-race-challenges/thread-join-counter-outer-race-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:05:52,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:05:52,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:05:52,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:05:52,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:05:52,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:05:52,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:05:52,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:05:52,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:05:52,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:05:52,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:05:52,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:05:52,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:05:52,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:05:52,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:05:52,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:05:52,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:05:52,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:05:52,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:05:52,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:05:52,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:05:52,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:05:52,531 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:05:52,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:05:52,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:05:52,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:05:52,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:05:52,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:05:52,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:05:52,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:05:52,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:05:52,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:05:52,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:05:52,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:05:52,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:05:52,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:05:52,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:05:52,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:05:52,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:05:52,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:05:52,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:05:52,542 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2024-11-19 06:05:52,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:05:52,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:05:52,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:05:52,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:05:52,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:05:52,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-19 06:05:54,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:05:54,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:05:54,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-19 06:05:54,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819232812/52ea0975b2a54de58994ab9e3649b46a/FLAG59128a0d0 [2024-11-19 06:05:54,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819232812/52ea0975b2a54de58994ab9e3649b46a [2024-11-19 06:05:54,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:05:54,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:05:54,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:05:54,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:05:54,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:05:54,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:05:54" (1/1) ... [2024-11-19 06:05:54,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2a70e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:54, skipping insertion in model container [2024-11-19 06:05:54,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:05:54" (1/1) ... [2024-11-19 06:05:54,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:05:55,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:05:55,060 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:05:55,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:05:55,168 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:05:55,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55 WrapperNode [2024-11-19 06:05:55,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:05:55,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:05:55,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:05:55,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:05:55,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,234 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-19 06:05:55,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:05:55,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:05:55,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:05:55,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:05:55,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:05:55,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:05:55,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:05:55,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:05:55,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (1/1) ... [2024-11-19 06:05:55,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:05:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:05:55,325 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 06:05:55,330 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 06:05:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 06:05:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:05:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:05:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-19 06:05:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-19 06:05:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 06:05:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:05:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:05:55,395 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 06:05:55,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:05:55,582 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:05:56,090 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:05:56,090 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:05:56,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:05:56,130 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:05:56,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:05:56 BoogieIcfgContainer [2024-11-19 06:05:56,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:05:56,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:05:56,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:05:56,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:05:56,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:05:54" (1/3) ... [2024-11-19 06:05:56,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95a9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:05:56, skipping insertion in model container [2024-11-19 06:05:56,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:05:55" (2/3) ... [2024-11-19 06:05:56,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95a9dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:05:56, skipping insertion in model container [2024-11-19 06:05:56,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:05:56" (3/3) ... [2024-11-19 06:05:56,139 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2024-11-19 06:05:56,153 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:05:56,153 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 06:05:56,153 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:05:56,215 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 06:05:56,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 232 transitions, 468 flow [2024-11-19 06:05:56,368 INFO L124 PetriNetUnfolderBase]: 7/274 cut-off events. [2024-11-19 06:05:56,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:05:56,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 7/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-19 06:05:56,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 232 transitions, 468 flow [2024-11-19 06:05:56,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 232 transitions, 468 flow [2024-11-19 06:05:56,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:05:56,411 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;@1106a243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:05:56,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-19 06:05:56,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:05:56,455 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-19 06:05:56,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:05:56,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:56,456 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:56,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:56,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1558289720, now seen corresponding path program 1 times [2024-11-19 06:05:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244961908] [2024-11-19 06:05:56,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:57,039 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 06:05:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:57,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244961908] [2024-11-19 06:05:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244961908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:57,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031510122] [2024-11-19 06:05:57,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:57,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:57,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:57,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-19 06:05:57,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:57,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:57,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-19 06:05:57,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:57,434 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2024-11-19 06:05:57,435 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:05:57,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3162 event pairs, 33 based on Foata normal form. 9/637 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2024-11-19 06:05:57,446 INFO L140 encePairwiseOnDemand]: 218/232 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2024-11-19 06:05:57,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2024-11-19 06:05:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-19 06:05:57,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9612068965517241 [2024-11-19 06:05:57,473 INFO L175 Difference]: Start difference. First operand has 231 places, 232 transitions, 468 flow. Second operand 3 states and 669 transitions. [2024-11-19 06:05:57,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2024-11-19 06:05:57,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:05:57,487 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2024-11-19 06:05:57,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-11-19 06:05:57,494 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-19 06:05:57,497 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2024-11-19 06:05:57,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:57,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:57,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:57,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:05:57,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:57,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -393361375, now seen corresponding path program 1 times [2024-11-19 06:05:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884571118] [2024-11-19 06:05:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:57,707 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 06:05:57,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:57,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884571118] [2024-11-19 06:05:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884571118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:57,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:57,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343282497] [2024-11-19 06:05:57,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:57,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:57,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:57,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-19 06:05:57,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:57,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:57,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-19 06:05:57,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:57,943 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2024-11-19 06:05:57,943 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2024-11-19 06:05:57,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4213 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2024-11-19 06:05:57,950 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2024-11-19 06:05:57,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2024-11-19 06:05:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-11-19 06:05:57,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367816091954023 [2024-11-19 06:05:57,953 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2024-11-19 06:05:57,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2024-11-19 06:05:57,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:57,966 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2024-11-19 06:05:57,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2024-11-19 06:05:57,968 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-19 06:05:57,968 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2024-11-19 06:05:57,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:57,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:57,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:57,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:05:57,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:57,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1871831431, now seen corresponding path program 1 times [2024-11-19 06:05:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257809729] [2024-11-19 06:05:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:58,137 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 06:05:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257809729] [2024-11-19 06:05:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257809729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:58,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:58,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730939676] [2024-11-19 06:05:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:58,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:58,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 232 [2024-11-19 06:05:58,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:58,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:58,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 232 [2024-11-19 06:05:58,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:58,304 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2024-11-19 06:05:58,305 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2024-11-19 06:05:58,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3732 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2024-11-19 06:05:58,310 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2024-11-19 06:05:58,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2024-11-19 06:05:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-19 06:05:58,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2024-11-19 06:05:58,317 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2024-11-19 06:05:58,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2024-11-19 06:05:58,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:58,326 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2024-11-19 06:05:58,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-19 06:05:58,328 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2024-11-19 06:05:58,328 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2024-11-19 06:05:58,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:58,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:58,330 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:05:58,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:58,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2000284448, now seen corresponding path program 1 times [2024-11-19 06:05:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:58,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518673161] [2024-11-19 06:05:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:58,480 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 06:05:58,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:58,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518673161] [2024-11-19 06:05:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518673161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:58,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:58,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:58,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087436114] [2024-11-19 06:05:58,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:58,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:58,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:58,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:58,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232 [2024-11-19 06:05:58,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:58,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:58,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232 [2024-11-19 06:05:58,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:58,631 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2024-11-19 06:05:58,632 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-19 06:05:58,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3947 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2024-11-19 06:05:58,636 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2024-11-19 06:05:58,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2024-11-19 06:05:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-19 06:05:58,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9525862068965517 [2024-11-19 06:05:58,640 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2024-11-19 06:05:58,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2024-11-19 06:05:58,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:58,648 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2024-11-19 06:05:58,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2024-11-19 06:05:58,649 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2024-11-19 06:05:58,649 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2024-11-19 06:05:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:58,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:58,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:05:58,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:58,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:58,653 INFO L85 PathProgramCache]: Analyzing trace with hash 319446888, now seen corresponding path program 1 times [2024-11-19 06:05:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:58,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006469789] [2024-11-19 06:05:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:58,778 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 06:05:58,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006469789] [2024-11-19 06:05:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006469789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:58,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:58,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954400141] [2024-11-19 06:05:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:58,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:58,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232 [2024-11-19 06:05:58,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:58,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:58,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232 [2024-11-19 06:05:58,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:58,959 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2024-11-19 06:05:58,960 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2024-11-19 06:05:58,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5124 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2024-11-19 06:05:58,965 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2024-11-19 06:05:58,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2024-11-19 06:05:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2024-11-19 06:05:58,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468390804597702 [2024-11-19 06:05:58,968 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2024-11-19 06:05:58,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2024-11-19 06:05:58,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:58,976 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2024-11-19 06:05:58,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2024-11-19 06:05:58,979 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-19 06:05:58,980 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2024-11-19 06:05:58,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:58,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:58,981 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:58,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:05:58,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:05:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2093932926, now seen corresponding path program 1 times [2024-11-19 06:05:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051083087] [2024-11-19 06:05:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:05:59,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:05:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:05:59,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:05:59,162 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:05:59,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-19 06:05:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-19 06:05:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-19 06:05:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-19 06:05:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-19 06:05:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-19 06:05:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-19 06:05:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-19 06:05:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-19 06:05:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-19 06:05:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-19 06:05:59,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:05:59,170 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 06:05:59,173 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:05:59,174 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 06:05:59,203 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 06:05:59,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 534 flow [2024-11-19 06:05:59,245 INFO L124 PetriNetUnfolderBase]: 10/354 cut-off events. [2024-11-19 06:05:59,246 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:05:59,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 354 events. 10/354 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2024-11-19 06:05:59,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 534 flow [2024-11-19 06:05:59,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 534 flow [2024-11-19 06:05:59,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:05:59,252 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;@1106a243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:05:59,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-19 06:05:59,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:05:59,295 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-19 06:05:59,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:05:59,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:59,295 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:59,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:05:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1014442248, now seen corresponding path program 1 times [2024-11-19 06:05:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860471160] [2024-11-19 06:05:59,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:59,370 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 06:05:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:59,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860471160] [2024-11-19 06:05:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860471160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680347370] [2024-11-19 06:05:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:59,403 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 262 [2024-11-19 06:05:59,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:59,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:59,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 262 [2024-11-19 06:05:59,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:00,609 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2024-11-19 06:06:00,609 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-19 06:06:00,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 63917 event pairs, 879 based on Foata normal form. 92/6148 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2024-11-19 06:06:00,782 INFO L140 encePairwiseOnDemand]: 244/262 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2024-11-19 06:06:00,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2024-11-19 06:06:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-19 06:06:00,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428 [2024-11-19 06:06:00,785 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 534 flow. Second operand 3 states and 750 transitions. [2024-11-19 06:06:00,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2024-11-19 06:06:00,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:06:00,790 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2024-11-19 06:06:00,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2024-11-19 06:06:00,792 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2024-11-19 06:06:00,792 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2024-11-19 06:06:00,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:00,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:00,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:00,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:06:00,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 755746279, now seen corresponding path program 1 times [2024-11-19 06:06:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840235485] [2024-11-19 06:06:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:00,863 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 06:06:00,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840235485] [2024-11-19 06:06:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840235485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709722389] [2024-11-19 06:06:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:00,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 262 [2024-11-19 06:06:00,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:00,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:00,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 262 [2024-11-19 06:06:00,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:02,450 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2024-11-19 06:06:02,450 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES. [2024-11-19 06:06:02,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2807/3012 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 88093 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2024-11-19 06:06:02,522 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2024-11-19 06:06:02,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2024-11-19 06:06:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2024-11-19 06:06:02,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338422391857506 [2024-11-19 06:06:02,525 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2024-11-19 06:06:02,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2024-11-19 06:06:02,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:02,539 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2024-11-19 06:06:02,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2024-11-19 06:06:02,542 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-19 06:06:02,542 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2024-11-19 06:06:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:02,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:02,543 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:02,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:06:02,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -609232263, now seen corresponding path program 1 times [2024-11-19 06:06:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112334696] [2024-11-19 06:06:02,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:02,724 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 06:06:02,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:02,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112334696] [2024-11-19 06:06:02,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112334696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:02,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288691603] [2024-11-19 06:06:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:02,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 262 [2024-11-19 06:06:02,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:02,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:02,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 262 [2024-11-19 06:06:02,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:03,966 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2024-11-19 06:06:03,966 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES. [2024-11-19 06:06:03,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1101/1918 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 82748 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2024-11-19 06:06:04,015 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2024-11-19 06:06:04,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2024-11-19 06:06:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-19 06:06:04,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-19 06:06:04,018 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2024-11-19 06:06:04,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2024-11-19 06:06:04,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:04,032 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2024-11-19 06:06:04,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2024-11-19 06:06:04,035 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2024-11-19 06:06:04,035 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2024-11-19 06:06:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:04,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:04,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:06:04,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:04,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1402832215, now seen corresponding path program 1 times [2024-11-19 06:06:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490342718] [2024-11-19 06:06:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:04,126 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 06:06:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490342718] [2024-11-19 06:06:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490342718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:04,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:04,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454881530] [2024-11-19 06:06:04,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:04,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:04,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-19 06:06:04,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:04,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:04,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-19 06:06:04,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:05,671 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2024-11-19 06:06:05,671 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2024-11-19 06:06:05,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 113160 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2024-11-19 06:06:05,732 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2024-11-19 06:06:05,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2024-11-19 06:06:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-19 06:06:05,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-19 06:06:05,735 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2024-11-19 06:06:05,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2024-11-19 06:06:05,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:05,747 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2024-11-19 06:06:05,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2024-11-19 06:06:05,748 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2024-11-19 06:06:05,749 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2024-11-19 06:06:05,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:05,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:05,749 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:05,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:06:05,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:05,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash -434774543, now seen corresponding path program 1 times [2024-11-19 06:06:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460424785] [2024-11-19 06:06:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:05,825 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 06:06:05,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460424785] [2024-11-19 06:06:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460424785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:05,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:05,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:05,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062139536] [2024-11-19 06:06:05,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:05,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:05,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:05,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-19 06:06:05,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:05,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:05,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-19 06:06:05,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:07,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][270], [281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-19 06:06:07,539 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-19 06:06:07,539 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-19 06:06:07,539 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-19 06:06:07,539 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-19 06:06:07,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [281#true, 38#L697true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-19 06:06:07,620 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-19 06:06:07,620 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-19 06:06:07,621 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-19 06:06:07,621 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-19 06:06:07,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [260#L697-3true, 281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-19 06:06:07,655 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-19 06:06:07,655 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-19 06:06:07,655 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-19 06:06:07,655 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-19 06:06:07,884 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2024-11-19 06:06:07,884 INFO L125 PetriNetUnfolderBase]: For 5573/5897 co-relation queries the response was YES. [2024-11-19 06:06:07,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5573/5897 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 146600 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2024-11-19 06:06:07,964 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2024-11-19 06:06:07,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2024-11-19 06:06:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-19 06:06:07,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2024-11-19 06:06:07,967 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2024-11-19 06:06:07,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2024-11-19 06:06:07,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:07,976 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2024-11-19 06:06:07,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2024-11-19 06:06:07,979 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-19 06:06:07,979 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2024-11-19 06:06:07,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:07,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:07,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:07,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:06:07,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:07,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:07,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1143101991, now seen corresponding path program 1 times [2024-11-19 06:06:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700609482] [2024-11-19 06:06:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:07,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:06:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700609482] [2024-11-19 06:06:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700609482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:06:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686248490] [2024-11-19 06:06:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:08,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:06:08,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:06:08,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:06:08,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:06:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:08,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:06:08,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:06:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:06:08,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:06:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686248490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:08,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:06:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 06:06:08,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059665148] [2024-11-19 06:06:08,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:08,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:06:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:08,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:06:08,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:06:08,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262 [2024-11-19 06:06:08,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:08,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:08,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262 [2024-11-19 06:06:08,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:10,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-19 06:06:10,830 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-19 06:06:10,830 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-19 06:06:10,830 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-19 06:06:10,830 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-19 06:06:10,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true, 295#(<= 1 ~threads_alive~0)]) [2024-11-19 06:06:10,833 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-19 06:06:10,833 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-19 06:06:10,833 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-19 06:06:10,833 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-19 06:06:10,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-19 06:06:10,988 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-19 06:06:10,988 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-19 06:06:10,988 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-19 06:06:10,988 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-19 06:06:10,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, 295#(<= 1 ~threads_alive~0), Black: 266#true]) [2024-11-19 06:06:10,990 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-19 06:06:10,990 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-19 06:06:10,990 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-19 06:06:10,990 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-19 06:06:11,459 INFO L124 PetriNetUnfolderBase]: 5622/18915 cut-off events. [2024-11-19 06:06:11,459 INFO L125 PetriNetUnfolderBase]: For 9477/10449 co-relation queries the response was YES. [2024-11-19 06:06:11,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38392 conditions, 18915 events. 5622/18915 cut-off events. For 9477/10449 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 229256 event pairs, 1257 based on Foata normal form. 132/17167 useless extension candidates. Maximal degree in co-relation 30507. Up to 3127 conditions per place. [2024-11-19 06:06:11,580 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 69 selfloop transitions, 14 changer transitions 3/361 dead transitions. [2024-11-19 06:06:11,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 361 transitions, 1219 flow [2024-11-19 06:06:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:06:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 06:06:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1718 transitions. [2024-11-19 06:06:11,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367502726281353 [2024-11-19 06:06:11,584 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 7 states and 1718 transitions. [2024-11-19 06:06:11,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 361 transitions, 1219 flow [2024-11-19 06:06:11,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 361 transitions, 1181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:11,646 INFO L231 Difference]: Finished difference. Result has 281 places, 315 transitions, 969 flow [2024-11-19 06:06:11,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=969, PETRI_PLACES=281, PETRI_TRANSITIONS=315} [2024-11-19 06:06:11,647 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 18 predicate places. [2024-11-19 06:06:11,647 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 315 transitions, 969 flow [2024-11-19 06:06:11,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:11,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:11,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:11,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:06:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 06:06:11,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:11,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1106641400, now seen corresponding path program 1 times [2024-11-19 06:06:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242486848] [2024-11-19 06:06:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:06:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242486848] [2024-11-19 06:06:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242486848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:12,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:06:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67893152] [2024-11-19 06:06:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:12,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:06:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:12,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:06:12,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:06:12,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-19 06:06:12,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 315 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:12,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:12,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-19 06:06:12,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:12,772 INFO L124 PetriNetUnfolderBase]: 216/1813 cut-off events. [2024-11-19 06:06:12,773 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-11-19 06:06:12,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 1813 events. 216/1813 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12701 event pairs, 65 based on Foata normal form. 79/1813 useless extension candidates. Maximal degree in co-relation 2647. Up to 212 conditions per place. [2024-11-19 06:06:12,783 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2024-11-19 06:06:12,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 762 flow [2024-11-19 06:06:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:06:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 06:06:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2024-11-19 06:06:12,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412213740458015 [2024-11-19 06:06:12,787 INFO L175 Difference]: Start difference. First operand has 281 places, 315 transitions, 969 flow. Second operand 5 states and 1233 transitions. [2024-11-19 06:06:12,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 762 flow [2024-11-19 06:06:12,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 714 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-19 06:06:12,796 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 677 flow [2024-11-19 06:06:12,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-11-19 06:06:12,797 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2024-11-19 06:06:12,797 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 677 flow [2024-11-19 06:06:12,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:12,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:12,799 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:06:12,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:06:12,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:12,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 374705611, now seen corresponding path program 1 times [2024-11-19 06:06:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936403524] [2024-11-19 06:06:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 06:06:12,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936403524] [2024-11-19 06:06:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936403524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336369019] [2024-11-19 06:06:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:12,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:12,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:12,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:12,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-19 06:06:12,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:12,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:12,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-19 06:06:12,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:13,311 INFO L124 PetriNetUnfolderBase]: 647/2737 cut-off events. [2024-11-19 06:06:13,311 INFO L125 PetriNetUnfolderBase]: For 860/872 co-relation queries the response was YES. [2024-11-19 06:06:13,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 2737 events. 647/2737 cut-off events. For 860/872 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 21879 event pairs, 351 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 4638. Up to 908 conditions per place. [2024-11-19 06:06:13,331 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/284 dead transitions. [2024-11-19 06:06:13,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 284 transitions, 811 flow [2024-11-19 06:06:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-19 06:06:13,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2024-11-19 06:06:13,334 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 677 flow. Second operand 3 states and 746 transitions. [2024-11-19 06:06:13,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 284 transitions, 811 flow [2024-11-19 06:06:13,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 284 transitions, 790 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 06:06:13,341 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 718 flow [2024-11-19 06:06:13,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2024-11-19 06:06:13,343 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-19 06:06:13,345 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 718 flow [2024-11-19 06:06:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:13,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:13,346 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:06:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:06:13,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 773386076, now seen corresponding path program 1 times [2024-11-19 06:06:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090478290] [2024-11-19 06:06:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 06:06:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090478290] [2024-11-19 06:06:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090478290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:06:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719394665] [2024-11-19 06:06:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:13,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:13,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:13,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 262 [2024-11-19 06:06:13,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:13,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:13,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 262 [2024-11-19 06:06:13,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:14,024 INFO L124 PetriNetUnfolderBase]: 335/2645 cut-off events. [2024-11-19 06:06:14,025 INFO L125 PetriNetUnfolderBase]: For 787/854 co-relation queries the response was YES. [2024-11-19 06:06:14,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2645 events. 335/2645 cut-off events. For 787/854 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22776 event pairs, 62 based on Foata normal form. 12/2575 useless extension candidates. Maximal degree in co-relation 3284. Up to 495 conditions per place. [2024-11-19 06:06:14,040 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 21 selfloop transitions, 9 changer transitions 0/287 dead transitions. [2024-11-19 06:06:14,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 287 transitions, 819 flow [2024-11-19 06:06:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-19 06:06:14,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9643765903307888 [2024-11-19 06:06:14,043 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 718 flow. Second operand 3 states and 758 transitions. [2024-11-19 06:06:14,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 287 transitions, 819 flow [2024-11-19 06:06:14,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 287 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:14,054 INFO L231 Difference]: Finished difference. Result has 275 places, 281 transitions, 764 flow [2024-11-19 06:06:14,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=275, PETRI_TRANSITIONS=281} [2024-11-19 06:06:14,055 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2024-11-19 06:06:14,055 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 281 transitions, 764 flow [2024-11-19 06:06:14,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:14,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:14,056 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:06:14,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:06:14,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:14,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1258401358, now seen corresponding path program 2 times [2024-11-19 06:06:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:14,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672616145] [2024-11-19 06:06:14,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:06:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:14,103 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:06:14,103 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:06:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:06:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672616145] [2024-11-19 06:06:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672616145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:06:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361071241] [2024-11-19 06:06:14,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:06:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:06:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:06:14,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:06:14,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:06:14,630 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:06:14,630 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:06:14,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:06:14,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:06:15,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:06:15,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:06:15,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:06:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:06:15,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:06:15,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_1109) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false [2024-11-19 06:06:15,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:06:15,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-19 06:06:15,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 06:06:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-11-19 06:06:15,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361071241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:06:15,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:06:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-19 06:06:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215509646] [2024-11-19 06:06:15,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:06:15,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:06:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:06:15,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-19 06:06:15,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2024-11-19 06:06:15,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 281 transitions, 764 flow. Second operand has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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 06:06:15,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:15,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2024-11-19 06:06:15,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:16,123 INFO L124 PetriNetUnfolderBase]: 192/1865 cut-off events. [2024-11-19 06:06:16,124 INFO L125 PetriNetUnfolderBase]: For 618/716 co-relation queries the response was YES. [2024-11-19 06:06:16,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 1865 events. 192/1865 cut-off events. For 618/716 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13561 event pairs, 18 based on Foata normal form. 47/1867 useless extension candidates. Maximal degree in co-relation 2320. Up to 247 conditions per place. [2024-11-19 06:06:16,132 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 38 selfloop transitions, 8 changer transitions 2/290 dead transitions. [2024-11-19 06:06:16,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 290 transitions, 887 flow [2024-11-19 06:06:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:06:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 06:06:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1196 transitions. [2024-11-19 06:06:16,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9129770992366413 [2024-11-19 06:06:16,135 INFO L175 Difference]: Start difference. First operand has 275 places, 281 transitions, 764 flow. Second operand 5 states and 1196 transitions. [2024-11-19 06:06:16,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 290 transitions, 887 flow [2024-11-19 06:06:16,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 290 transitions, 876 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 06:06:16,143 INFO L231 Difference]: Finished difference. Result has 278 places, 277 transitions, 745 flow [2024-11-19 06:06:16,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=745, PETRI_PLACES=278, PETRI_TRANSITIONS=277} [2024-11-19 06:06:16,144 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2024-11-19 06:06:16,144 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 277 transitions, 745 flow [2024-11-19 06:06:16,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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 06:06:16,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:16,146 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:06:16,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:06:16,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 06:06:16,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:16,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1925231661, now seen corresponding path program 1 times [2024-11-19 06:06:16,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299863387] [2024-11-19 06:06:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:16,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 06:06:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299863387] [2024-11-19 06:06:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299863387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786233486] [2024-11-19 06:06:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:16,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:16,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-19 06:06:16,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 277 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:16,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:16,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-19 06:06:16,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:16,759 INFO L124 PetriNetUnfolderBase]: 304/2282 cut-off events. [2024-11-19 06:06:16,759 INFO L125 PetriNetUnfolderBase]: For 1306/1398 co-relation queries the response was YES. [2024-11-19 06:06:16,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2282 events. 304/2282 cut-off events. For 1306/1398 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 18038 event pairs, 154 based on Foata normal form. 3/2224 useless extension candidates. Maximal degree in co-relation 3773. Up to 664 conditions per place. [2024-11-19 06:06:16,772 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 37 selfloop transitions, 2 changer transitions 2/279 dead transitions. [2024-11-19 06:06:16,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 279 transitions, 839 flow [2024-11-19 06:06:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-11-19 06:06:16,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9223918575063613 [2024-11-19 06:06:16,774 INFO L175 Difference]: Start difference. First operand has 278 places, 277 transitions, 745 flow. Second operand 3 states and 725 transitions. [2024-11-19 06:06:16,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 279 transitions, 839 flow [2024-11-19 06:06:16,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 279 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 06:06:16,782 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 730 flow [2024-11-19 06:06:16,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2024-11-19 06:06:16,783 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2024-11-19 06:06:16,783 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 730 flow [2024-11-19 06:06:16,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:16,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:16,784 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:06:16,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:06:16,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-19 06:06:16,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 608177901, now seen corresponding path program 1 times [2024-11-19 06:06:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327143944] [2024-11-19 06:06:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:06:16,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:06:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:06:16,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:06:16,891 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:06:16,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-19 06:06:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-19 06:06:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-19 06:06:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-19 06:06:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-19 06:06:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-19 06:06:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-19 06:06:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-19 06:06:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-19 06:06:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-19 06:06:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-19 06:06:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-19 06:06:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-19 06:06:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-19 06:06:16,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:06:16,894 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:06:16,895 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:06:16,895 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 06:06:16,917 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 06:06:16,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 292 transitions, 602 flow [2024-11-19 06:06:16,965 INFO L124 PetriNetUnfolderBase]: 13/434 cut-off events. [2024-11-19 06:06:16,965 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 06:06:16,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 434 events. 13/434 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 581 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 358. Up to 8 conditions per place. [2024-11-19 06:06:16,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 292 transitions, 602 flow [2024-11-19 06:06:16,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 292 transitions, 602 flow [2024-11-19 06:06:16,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:06:16,971 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;@1106a243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:06:16,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-19 06:06:16,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:06:16,980 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-19 06:06:16,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:06:16,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:16,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:16,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-19 06:06:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -176942728, now seen corresponding path program 1 times [2024-11-19 06:06:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979503879] [2024-11-19 06:06:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:17,030 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 06:06:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979503879] [2024-11-19 06:06:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979503879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:17,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609033198] [2024-11-19 06:06:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:17,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:17,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:17,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 292 [2024-11-19 06:06:17,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:17,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:17,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 292 [2024-11-19 06:06:17,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:28,218 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2024-11-19 06:06:28,219 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-19 06:06:28,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2925. Compared 957543 event pairs, 14941 based on Foata normal form. 986/71986 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2024-11-19 06:06:28,779 INFO L140 encePairwiseOnDemand]: 270/292 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2024-11-19 06:06:28,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2024-11-19 06:06:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2024-11-19 06:06:28,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2024-11-19 06:06:28,781 INFO L175 Difference]: Start difference. First operand has 295 places, 292 transitions, 602 flow. Second operand 3 states and 831 transitions. [2024-11-19 06:06:28,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2024-11-19 06:06:28,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-19 06:06:28,789 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2024-11-19 06:06:28,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2024-11-19 06:06:28,790 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2024-11-19 06:06:28,790 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2024-11-19 06:06:28,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:28,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:28,790 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:28,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:06:28,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-19 06:06:28,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1511854987, now seen corresponding path program 1 times [2024-11-19 06:06:28,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:28,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010645383] [2024-11-19 06:06:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:28,841 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 06:06:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010645383] [2024-11-19 06:06:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010645383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:28,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679507895] [2024-11-19 06:06:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:28,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:28,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 292 [2024-11-19 06:06:28,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:28,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:28,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 292 [2024-11-19 06:06:28,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:06:34,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:34,392 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-19 06:06:34,392 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:34,392 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:34,393 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:34,393 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,393 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,394 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,778 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:34,778 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-19 06:06:34,778 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,778 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,778 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,778 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-19 06:06:34,780 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:34,780 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-19 06:06:34,780 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,781 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,781 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:06:34,781 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-19 06:06:35,145 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:35,146 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-19 06:06:35,146 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:35,146 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:35,146 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-19 06:06:35,146 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:35,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:35,147 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-19 06:06:35,147 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-19 06:06:35,147 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:35,147 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:06:36,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [33#L691-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:36,387 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-19 06:06:36,387 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-19 06:06:36,387 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-19 06:06:36,388 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-19 06:06:36,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 33#L691-3true, 44#L695-5true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:36,390 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2024-11-19 06:06:36,390 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-19 06:06:36,390 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-19 06:06:36,390 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-19 06:06:37,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:37,590 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-19 06:06:37,590 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-19 06:06:37,590 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:37,590 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-19 06:06:37,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 33#L691-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:37,593 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2024-11-19 06:06:37,593 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:37,593 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-19 06:06:37,593 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2024-11-19 06:06:38,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:38,462 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:38,463 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:38,463 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,463 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,722 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:38,722 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-19 06:06:38,722 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-19 06:06:38,722 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,722 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,722 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,724 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:38,724 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-19 06:06:38,724 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,724 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-19 06:06:38,724 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:38,724 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-19 06:06:39,001 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:39,001 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-19 06:06:39,001 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-19 06:06:39,001 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:39,001 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:39,001 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:39,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:39,002 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-19 06:06:39,002 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:39,002 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-19 06:06:39,002 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:39,004 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:39,004 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 292#true, 262#L694-3true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:39,004 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-19 06:06:39,005 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,005 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,005 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,643 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:39,643 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-19 06:06:39,643 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,643 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-19 06:06:39,643 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,643 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,646 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 294#true, 221#L695-2true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:39,646 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-19 06:06:39,646 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-19 06:06:39,646 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,646 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:39,646 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-19 06:06:40,042 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [262#L694-3true, 303#true, 292#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:40,043 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-19 06:06:40,043 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:40,043 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-19 06:06:40,043 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:40,043 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:40,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [303#true, 262#L694-3true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:40,044 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-19 06:06:40,044 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-19 06:06:40,044 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:40,044 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-19 06:06:40,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [156#L693-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:40,447 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-19 06:06:40,447 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:06:40,447 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-19 06:06:40,447 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-19 06:06:40,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 156#L693-3true, 44#L695-5true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:40,452 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-19 06:06:40,452 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:06:40,452 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-19 06:06:40,452 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-19 06:06:41,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [262#L694-3true, 303#true, 292#true, 294#true, 102#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:41,530 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-19 06:06:41,530 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-19 06:06:41,530 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-19 06:06:41,530 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-19 06:06:41,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 44#L695-5true, 262#L694-3true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2024-11-19 06:06:41,534 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-19 06:06:41,534 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-19 06:06:41,534 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-19 06:06:41,534 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-19 06:06:41,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:41,816 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-19 06:06:41,816 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-19 06:06:41,816 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-19 06:06:41,816 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-19 06:06:41,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:41,820 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-19 06:06:41,820 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-19 06:06:41,820 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-19 06:06:41,820 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-19 06:06:42,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 262#L694-3true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:42,671 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-19 06:06:42,671 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:06:42,671 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:06:42,671 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-19 06:06:42,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 262#L694-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:42,678 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2024-11-19 06:06:42,678 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-19 06:06:42,678 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:06:42,678 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:06:44,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [124#L697-3true, 303#true, 292#true, 157#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, 219#L712-1true, Black: 298#true]) [2024-11-19 06:06:44,222 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-19 06:06:44,222 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-19 06:06:44,222 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-19 06:06:44,222 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-19 06:06:44,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, 219#L712-1true, Black: 298#true, 273#L697-3true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-19 06:06:44,223 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-19 06:06:44,223 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-19 06:06:44,223 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-19 06:06:44,223 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-19 06:06:44,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1004] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true, 273#L697-3true]) [2024-11-19 06:06:44,226 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-19 06:06:44,226 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-19 06:06:44,226 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-19 06:06:44,226 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-19 06:06:44,383 INFO L124 PetriNetUnfolderBase]: 38618/99725 cut-off events. [2024-11-19 06:06:44,383 INFO L125 PetriNetUnfolderBase]: For 39987/44110 co-relation queries the response was YES. [2024-11-19 06:06:44,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192268 conditions, 99725 events. 38618/99725 cut-off events. For 39987/44110 co-relation queries the response was YES. Maximal size of possible extension queue 3203. Compared 1335002 event pairs, 24930 based on Foata normal form. 654/90669 useless extension candidates. Maximal degree in co-relation 190021. Up to 46398 conditions per place. [2024-11-19 06:06:45,214 INFO L140 encePairwiseOnDemand]: 282/292 looper letters, 55 selfloop transitions, 16 changer transitions 0/328 dead transitions. [2024-11-19 06:06:45,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 328 transitions, 944 flow [2024-11-19 06:06:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:06:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:06:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2024-11-19 06:06:45,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2024-11-19 06:06:45,217 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 714 flow. Second operand 3 states and 816 transitions. [2024-11-19 06:06:45,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 328 transitions, 944 flow [2024-11-19 06:06:45,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 328 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:06:45,429 INFO L231 Difference]: Finished difference. Result has 300 places, 316 transitions, 832 flow [2024-11-19 06:06:45,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=300, PETRI_TRANSITIONS=316} [2024-11-19 06:06:45,430 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 5 predicate places. [2024-11-19 06:06:45,430 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 316 transitions, 832 flow [2024-11-19 06:06:45,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:06:45,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:06:45,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:06:45,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:06:45,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-19 06:06:45,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:06:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1355301497, now seen corresponding path program 1 times [2024-11-19 06:06:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:06:45,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890831056] [2024-11-19 06:06:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:06:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:06:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:06:45,483 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 06:06:45,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:06:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890831056] [2024-11-19 06:06:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890831056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:06:45,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:06:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:06:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644814590] [2024-11-19 06:06:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:06:45,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:06:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:06:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:06:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:06:45,499 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 292 [2024-11-19 06:06:45,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 316 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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 06:06:45,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:06:45,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 292 [2024-11-19 06:06:45,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand