./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-09 21:39:28,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:39:28,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:39:28,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:39:28,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:39:28,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:39:28,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:39:28,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:39:28,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:39:28,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:39:28,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:39:28,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:39:28,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:39:28,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:39:28,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:28,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:28,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:39:28,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:39:28,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:39:28,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:39:28,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:39:28,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:39:28,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:39:28,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:39:28,135 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 [2025-01-09 21:39:28,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:39:28,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:39:28,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:39:28,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:39:28,363 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:39:28,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2025-01-09 21:39:29,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eef8fd5aa/36cf36cb71b84dc79850c228ed13812e/FLAG5513fd0e1 [2025-01-09 21:39:29,810 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:39:29,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2025-01-09 21:39:29,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eef8fd5aa/36cf36cb71b84dc79850c228ed13812e/FLAG5513fd0e1 [2025-01-09 21:39:30,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eef8fd5aa/36cf36cb71b84dc79850c228ed13812e [2025-01-09 21:39:30,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:39:30,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:39:30,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:30,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:39:30,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:39:30,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1581076a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30, skipping insertion in model container [2025-01-09 21:39:30,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:39:30,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:30,341 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:39:30,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:39:30,417 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:39:30,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30 WrapperNode [2025-01-09 21:39:30,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:39:30,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:30,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:39:30,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:39:30,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,467 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-01-09 21:39:30,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:39:30,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:39:30,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:39:30,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:39:30,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:39:30,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:39:30,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:39:30,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:39:30,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (1/1) ... [2025-01-09 21:39:30,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:39:30,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:39:30,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:39:30,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:39:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:39:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:39:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:39:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:39:30,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:39:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:39:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:39:30,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:39:30,570 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:39:30,664 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:39:30,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:39:30,918 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:39:30,921 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:39:30,957 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:39:30,957 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:39:30,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:30 BoogieIcfgContainer [2025-01-09 21:39:30,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:39:30,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:39:30,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:39:30,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:39:30,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:30" (1/3) ... [2025-01-09 21:39:30,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efd8a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:30, skipping insertion in model container [2025-01-09 21:39:30,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:30" (2/3) ... [2025-01-09 21:39:30,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efd8a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:30, skipping insertion in model container [2025-01-09 21:39:30,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:30" (3/3) ... [2025-01-09 21:39:30,968 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2025-01-09 21:39:30,978 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:39:30,980 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-4.i that has 2 procedures, 228 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-01-09 21:39:30,980 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:39:31,035 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:31,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 231 transitions, 466 flow [2025-01-09 21:39:31,223 INFO L124 PetriNetUnfolderBase]: 5/272 cut-off events. [2025-01-09 21:39:31,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:31,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 5/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 233 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-01-09 21:39:31,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 231 transitions, 466 flow [2025-01-09 21:39:31,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 231 transitions, 466 flow [2025-01-09 21:39:31,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:31,260 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;@7ce5f215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:31,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:39:31,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:31,295 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-01-09 21:39:31,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:31,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:31,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:31,296 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)] === [2025-01-09 21:39:31,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash -588769515, now seen corresponding path program 1 times [2025-01-09 21:39:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899961156] [2025-01-09 21:39:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:31,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:39:31,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:39:31,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:31,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899961156] [2025-01-09 21:39:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899961156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271490783] [2025-01-09 21:39:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:31,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:31,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:31,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:31,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-01-09 21:39:31,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 466 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) [2025-01-09 21:39:31,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:31,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-01-09 21:39:31,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:31,899 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2025-01-09 21:39:31,899 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:39:31,901 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 33. Compared 3162 event pairs, 33 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2025-01-09 21:39:31,903 INFO L140 encePairwiseOnDemand]: 218/231 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2025-01-09 21:39:31,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2025-01-09 21:39:31,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-01-09 21:39:31,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9624819624819625 [2025-01-09 21:39:31,914 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 466 flow. Second operand 3 states and 667 transitions. [2025-01-09 21:39:31,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2025-01-09 21:39:31,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:31,925 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2025-01-09 21:39:31,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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} [2025-01-09 21:39:31,930 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2025-01-09 21:39:31,931 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2025-01-09 21:39:31,932 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) [2025-01-09 21:39:31,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:31,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:31,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:39:31,932 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)] === [2025-01-09 21:39:31,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1869749631, now seen corresponding path program 1 times [2025-01-09 21:39:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:31,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922735549] [2025-01-09 21:39:31,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:31,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:31,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:39:31,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:39:31,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:31,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922735549] [2025-01-09 21:39:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922735549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:32,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077310913] [2025-01-09 21:39:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:32,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:32,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:32,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:32,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-01-09 21:39:32,112 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) [2025-01-09 21:39:32,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:32,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-01-09 21:39:32,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:32,217 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2025-01-09 21:39:32,218 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2025-01-09 21:39:32,219 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 35. Compared 4209 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. [2025-01-09 21:39:32,221 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2025-01-09 21:39:32,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2025-01-09 21:39:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-01-09 21:39:32,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408369408369408 [2025-01-09 21:39:32,223 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2025-01-09 21:39:32,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2025-01-09 21:39:32,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:32,228 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2025-01-09 21:39:32,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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} [2025-01-09 21:39:32,229 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2025-01-09 21:39:32,229 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2025-01-09 21:39:32,230 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) [2025-01-09 21:39:32,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:32,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:32,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:39:32,230 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)] === [2025-01-09 21:39:32,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash 799958647, now seen corresponding path program 1 times [2025-01-09 21:39:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740235329] [2025-01-09 21:39:32,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:32,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:32,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:32,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:32,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:32,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:32,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740235329] [2025-01-09 21:39:32,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740235329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:32,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:32,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700664577] [2025-01-09 21:39:32,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:32,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:32,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:32,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:32,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2025-01-09 21:39:32,375 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) [2025-01-09 21:39:32,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:32,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2025-01-09 21:39:32,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:32,487 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2025-01-09 21:39:32,487 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2025-01-09 21:39:32,488 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 3703 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. [2025-01-09 21:39:32,490 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2025-01-09 21:39:32,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2025-01-09 21:39:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-01-09 21:39:32,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581529581529582 [2025-01-09 21:39:32,492 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2025-01-09 21:39:32,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2025-01-09 21:39:32,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:32,496 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2025-01-09 21:39:32,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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} [2025-01-09 21:39:32,497 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2025-01-09 21:39:32,497 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2025-01-09 21:39:32,497 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) [2025-01-09 21:39:32,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:32,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:39:32,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:32,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 838651774, now seen corresponding path program 1 times [2025-01-09 21:39:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:32,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223913965] [2025-01-09 21:39:32,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:32,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:32,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:39:32,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:39:32,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:32,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223913965] [2025-01-09 21:39:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223913965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:32,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651425952] [2025-01-09 21:39:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:32,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:32,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:32,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:32,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2025-01-09 21:39:32,623 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) [2025-01-09 21:39:32,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:32,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2025-01-09 21:39:32,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:32,740 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2025-01-09 21:39:32,740 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2025-01-09 21:39:32,741 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 3977 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. [2025-01-09 21:39:32,742 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-01-09 21:39:32,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2025-01-09 21:39:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-01-09 21:39:32,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2025-01-09 21:39:32,744 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2025-01-09 21:39:32,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2025-01-09 21:39:32,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:32,748 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2025-01-09 21:39:32,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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} [2025-01-09 21:39:32,749 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2025-01-09 21:39:32,749 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2025-01-09 21:39:32,749 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) [2025-01-09 21:39:32,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:32,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:39:32,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:32,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1494587002, now seen corresponding path program 1 times [2025-01-09 21:39:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449813630] [2025-01-09 21:39:32,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:32,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 21:39:32,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 21:39:32,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:32,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:32,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449813630] [2025-01-09 21:39:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449813630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:32,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:32,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245050233] [2025-01-09 21:39:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:32,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:32,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:32,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:32,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:32,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2025-01-09 21:39:32,850 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) [2025-01-09 21:39:32,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:32,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2025-01-09 21:39:32,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:32,971 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2025-01-09 21:39:32,971 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2025-01-09 21:39:32,973 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 5160 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. [2025-01-09 21:39:32,975 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2025-01-09 21:39:32,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2025-01-09 21:39:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-01-09 21:39:32,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950937950937951 [2025-01-09 21:39:32,977 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2025-01-09 21:39:32,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2025-01-09 21:39:32,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:32,982 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2025-01-09 21:39:32,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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} [2025-01-09 21:39:32,983 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2025-01-09 21:39:32,983 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2025-01-09 21:39:32,983 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) [2025-01-09 21:39:32,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:32,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:39:32,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:32,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash -980302693, now seen corresponding path program 1 times [2025-01-09 21:39:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222251721] [2025-01-09 21:39:32,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:32,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:33,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:33,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:33,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:33,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:33,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:33,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222251721] [2025-01-09 21:39:33,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222251721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:33,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:33,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:33,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559201486] [2025-01-09 21:39:33,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:33,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:39:33,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:33,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:39:33,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:39:33,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2025-01-09 21:39:33,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 250 transitions, 674 flow. Second operand has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 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) [2025-01-09 21:39:33,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:33,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2025-01-09 21:39:33,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:33,383 INFO L124 PetriNetUnfolderBase]: 142/853 cut-off events. [2025-01-09 21:39:33,383 INFO L125 PetriNetUnfolderBase]: For 276/280 co-relation queries the response was YES. [2025-01-09 21:39:33,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 853 events. 142/853 cut-off events. For 276/280 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4446 event pairs, 39 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 1306. Up to 140 conditions per place. [2025-01-09 21:39:33,387 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 29 selfloop transitions, 7 changer transitions 3/265 dead transitions. [2025-01-09 21:39:33,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 265 transitions, 770 flow [2025-01-09 21:39:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2025-01-09 21:39:33,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9343434343434344 [2025-01-09 21:39:33,390 INFO L175 Difference]: Start difference. First operand has 242 places, 250 transitions, 674 flow. Second operand 6 states and 1295 transitions. [2025-01-09 21:39:33,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 265 transitions, 770 flow [2025-01-09 21:39:33,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 265 transitions, 734 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-09 21:39:33,395 INFO L231 Difference]: Finished difference. Result has 242 places, 251 transitions, 660 flow [2025-01-09 21:39:33,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=242, PETRI_TRANSITIONS=251} [2025-01-09 21:39:33,396 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2025-01-09 21:39:33,396 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 251 transitions, 660 flow [2025-01-09 21:39:33,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 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) [2025-01-09 21:39:33,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:33,397 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:39:33,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:39:33,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1257520556, now seen corresponding path program 1 times [2025-01-09 21:39:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008091020] [2025-01-09 21:39:33,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:33,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:33,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:33,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:33,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:33,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:33,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:33,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:33,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:33,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:33,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:33,508 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:33,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-09 21:39:33,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-01-09 21:39:33,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-01-09 21:39:33,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:39:33,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:33,512 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:39:33,512 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:39:33,528 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:33,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 261 transitions, 532 flow [2025-01-09 21:39:33,563 INFO L124 PetriNetUnfolderBase]: 7/351 cut-off events. [2025-01-09 21:39:33,563 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:39:33,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 351 events. 7/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 401 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 273. Up to 6 conditions per place. [2025-01-09 21:39:33,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 261 transitions, 532 flow [2025-01-09 21:39:33,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 261 transitions, 532 flow [2025-01-09 21:39:33,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:33,568 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;@7ce5f215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:33,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 21:39:33,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:33,578 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-01-09 21:39:33,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:33,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:33,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:33,579 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)] === [2025-01-09 21:39:33,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash 733460277, now seen corresponding path program 1 times [2025-01-09 21:39:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:33,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20060632] [2025-01-09 21:39:33,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:33,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:33,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:39:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:39:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:33,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:33,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:33,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20060632] [2025-01-09 21:39:33,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20060632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:33,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098737424] [2025-01-09 21:39:33,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:33,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:33,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:33,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:33,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:33,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 261 [2025-01-09 21:39:33,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 261 transitions, 532 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) [2025-01-09 21:39:33,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:33,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 261 [2025-01-09 21:39:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:34,435 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2025-01-09 21:39:34,435 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-09 21:39:34,446 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 294. Compared 63858 event pairs, 879 based on Foata normal form. 1/6057 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2025-01-09 21:39:34,468 INFO L140 encePairwiseOnDemand]: 244/261 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2025-01-09 21:39:34,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2025-01-09 21:39:34,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-01-09 21:39:34,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553001277139208 [2025-01-09 21:39:34,471 INFO L175 Difference]: Start difference. First operand has 263 places, 261 transitions, 532 flow. Second operand 3 states and 748 transitions. [2025-01-09 21:39:34,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2025-01-09 21:39:34,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:34,474 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2025-01-09 21:39:34,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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} [2025-01-09 21:39:34,475 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2025-01-09 21:39:34,475 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2025-01-09 21:39:34,475 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) [2025-01-09 21:39:34,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:34,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:34,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:39:34,476 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)] === [2025-01-09 21:39:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1457135908, now seen corresponding path program 1 times [2025-01-09 21:39:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:34,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695825889] [2025-01-09 21:39:34,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:34,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:39:34,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:39:34,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:34,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:34,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695825889] [2025-01-09 21:39:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695825889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:34,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:34,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:34,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361571358] [2025-01-09 21:39:34,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:34,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:34,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:34,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:34,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:34,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 261 [2025-01-09 21:39:34,558 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) [2025-01-09 21:39:34,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:34,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 261 [2025-01-09 21:39:34,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:35,491 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2025-01-09 21:39:35,491 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES. [2025-01-09 21:39:35,509 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 315. Compared 87925 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. [2025-01-09 21:39:35,541 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2025-01-09 21:39:35,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2025-01-09 21:39:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2025-01-09 21:39:35,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374201787994891 [2025-01-09 21:39:35,543 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2025-01-09 21:39:35,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2025-01-09 21:39:35,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:35,554 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2025-01-09 21:39:35,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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} [2025-01-09 21:39:35,555 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2025-01-09 21:39:35,555 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2025-01-09 21:39:35,555 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) [2025-01-09 21:39:35,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:35,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:35,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:39:35,556 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)] === [2025-01-09 21:39:35,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 893835383, now seen corresponding path program 1 times [2025-01-09 21:39:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253928057] [2025-01-09 21:39:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:35,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:39:35,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:39:35,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:35,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:35,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253928057] [2025-01-09 21:39:35,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253928057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:35,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:35,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896978510] [2025-01-09 21:39:35,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:35,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:35,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:35,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:35,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 261 [2025-01-09 21:39:35,637 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) [2025-01-09 21:39:35,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:35,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 261 [2025-01-09 21:39:35,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:36,394 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2025-01-09 21:39:36,394 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES. [2025-01-09 21:39:36,413 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 328. Compared 82514 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. [2025-01-09 21:39:36,437 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2025-01-09 21:39:36,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2025-01-09 21:39:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-01-09 21:39:36,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-01-09 21:39:36,439 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2025-01-09 21:39:36,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2025-01-09 21:39:36,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:36,451 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2025-01-09 21:39:36,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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} [2025-01-09 21:39:36,453 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2025-01-09 21:39:36,453 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2025-01-09 21:39:36,454 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) [2025-01-09 21:39:36,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:36,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:36,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:39:36,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:36,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:36,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2049600006, now seen corresponding path program 1 times [2025-01-09 21:39:36,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:36,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-01-09 21:39:36,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:36,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:36,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:39:36,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:39:36,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:36,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-01-09 21:39:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215205486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:36,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578723469] [2025-01-09 21:39:36,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:36,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:36,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:36,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:36,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-01-09 21:39:36,618 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) [2025-01-09 21:39:36,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:36,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-01-09 21:39:36,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:37,560 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2025-01-09 21:39:37,561 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2025-01-09 21:39:37,583 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 417. Compared 113101 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. [2025-01-09 21:39:37,609 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2025-01-09 21:39:37,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2025-01-09 21:39:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-01-09 21:39:37,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-01-09 21:39:37,612 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2025-01-09 21:39:37,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2025-01-09 21:39:37,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:37,621 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2025-01-09 21:39:37,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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} [2025-01-09 21:39:37,623 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2025-01-09 21:39:37,623 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2025-01-09 21:39:37,623 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) [2025-01-09 21:39:37,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:37,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:37,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:39:37,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:37,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash 479224782, now seen corresponding path program 1 times [2025-01-09 21:39:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820434153] [2025-01-09 21:39:37,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:37,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 21:39:37,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 21:39:37,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:37,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:37,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820434153] [2025-01-09 21:39:37,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820434153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:37,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:37,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760896244] [2025-01-09 21:39:37,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:37,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:37,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:37,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:37,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-01-09 21:39:37,734 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) [2025-01-09 21:39:37,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:37,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-01-09 21:39:37,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:39,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->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][267], [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]) [2025-01-09 21:39:39,019 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:39,019 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:39,019 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:39,019 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:39,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->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][170], [281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, 39#L697true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-01-09 21:39:39,080 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:39,080 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:39,080 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:39,080 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:39,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->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][170], [281#true, 260#L697-3true, 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]) [2025-01-09 21:39:39,137 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-01-09 21:39:39,137 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:39:39,137 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-01-09 21:39:39,137 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-01-09 21:39:39,252 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2025-01-09 21:39:39,252 INFO L125 PetriNetUnfolderBase]: For 5573/5897 co-relation queries the response was YES. [2025-01-09 21:39:39,277 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 474. Compared 146249 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. [2025-01-09 21:39:39,308 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2025-01-09 21:39:39,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2025-01-09 21:39:39,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-01-09 21:39:39,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476372924648787 [2025-01-09 21:39:39,310 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2025-01-09 21:39:39,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2025-01-09 21:39:39,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:39,315 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2025-01-09 21:39:39,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, 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} [2025-01-09 21:39:39,316 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-01-09 21:39:39,316 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2025-01-09 21:39:39,316 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) [2025-01-09 21:39:39,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:39,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:39,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:39:39,317 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)] === [2025-01-09 21:39:39,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 776884931, now seen corresponding path program 1 times [2025-01-09 21:39:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346524370] [2025-01-09 21:39:39,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:39,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:39:39,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:39:39,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:39,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346524370] [2025-01-09 21:39:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346524370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:39,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:39:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505300588] [2025-01-09 21:39:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:39:39,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:39,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:39:39,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:39:39,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 261 [2025-01-09 21:39:39,481 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) [2025-01-09 21:39:39,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:39,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 261 [2025-01-09 21:39:39,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:40,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->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][274], [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]) [2025-01-09 21:39:40,357 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,358 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:40,358 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,358 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:40,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L705-5-->L705-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 271#true, 61#L705-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 268#(= |#race~threads_alive~0| 0), 264#true]) [2025-01-09 21:39:40,386 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-01-09 21:39:40,386 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:40,386 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:40,386 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:40,407 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([764] L713-5-->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][274], [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]) [2025-01-09 21:39:40,407 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,407 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:40,407 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,407 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,408 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:40,413 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([764] L713-5-->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][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-01-09 21:39:40,413 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,413 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:40,413 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,413 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,413 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,413 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:40,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [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, 39#L697true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-01-09 21:39:40,458 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,458 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:40,458 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:40,458 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->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][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 197#L695-1true, Black: 266#true]) [2025-01-09 21:39:40,466 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-01-09 21:39:40,466 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:40,466 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:39:40,466 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-01-09 21:39:40,552 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([764] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [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), 39#L697true, 221#L695-2true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-01-09 21:39:40,553 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,553 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:40,553 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:39:40,553 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,553 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [146#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-01-09 21:39:40,562 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,562 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,562 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:39:40,562 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:39:40,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([764] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [260#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-01-09 21:39:40,719 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-01-09 21:39:40,719 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:39:40,719 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-01-09 21:39:40,719 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:39:40,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([828] L695-2-->L695-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2)) InVars {~threads_alive~0=v_~threads_alive~0_7} OutVars{~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][290], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 28#L695-3true, 286#true, 218#L695-3true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 237#L706-3true, Black: 266#true]) [2025-01-09 21:39:40,728 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,728 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,728 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,728 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:39:40,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([801] L695-4-->L695-5: Formula: (= |v_#race~threads_alive~0_11| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_11|} AuxVars[] AssignedVars[#race~threads_alive~0][222], [30#L695-5true, Black: 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, 233#L706true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 268#(= |#race~threads_alive~0| 0)]) [2025-01-09 21:39:40,766 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is not cut-off event [2025-01-09 21:39:40,766 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-01-09 21:39:40,766 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-01-09 21:39:40,766 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-01-09 21:39:40,937 INFO L124 PetriNetUnfolderBase]: 4737/15801 cut-off events. [2025-01-09 21:39:40,938 INFO L125 PetriNetUnfolderBase]: For 6564/7144 co-relation queries the response was YES. [2025-01-09 21:39:40,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 15801 events. 4737/15801 cut-off events. For 6564/7144 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 184916 event pairs, 1712 based on Foata normal form. 71/14047 useless extension candidates. Maximal degree in co-relation 16596. Up to 4209 conditions per place. [2025-01-09 21:39:41,014 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 45 selfloop transitions, 9 changer transitions 2/332 dead transitions. [2025-01-09 21:39:41,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 1100 flow [2025-01-09 21:39:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:39:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:39:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-01-09 21:39:41,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929757343550447 [2025-01-09 21:39:41,017 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 6 states and 1456 transitions. [2025-01-09 21:39:41,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 1100 flow [2025-01-09 21:39:41,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:41,039 INFO L231 Difference]: Finished difference. Result has 279 places, 309 transitions, 941 flow [2025-01-09 21:39:41,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=279, PETRI_TRANSITIONS=309} [2025-01-09 21:39:41,040 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 16 predicate places. [2025-01-09 21:39:41,040 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 309 transitions, 941 flow [2025-01-09 21:39:41,041 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) [2025-01-09 21:39:41,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:41,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:39:41,041 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)] === [2025-01-09 21:39:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash -688948549, now seen corresponding path program 1 times [2025-01-09 21:39:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:41,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989191859] [2025-01-09 21:39:41,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:41,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 21:39:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 21:39:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:41,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989191859] [2025-01-09 21:39:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989191859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:41,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:41,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:39:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174060925] [2025-01-09 21:39:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:41,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:41,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:41,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:41,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-01-09 21:39:41,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 309 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:41,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:41,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-01-09 21:39:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:41,810 INFO L124 PetriNetUnfolderBase]: 321/2651 cut-off events. [2025-01-09 21:39:41,810 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2025-01-09 21:39:41,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2651 events. 321/2651 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22737 event pairs, 119 based on Foata normal form. 86/2586 useless extension candidates. Maximal degree in co-relation 4104. Up to 283 conditions per place. [2025-01-09 21:39:41,826 INFO L140 encePairwiseOnDemand]: 249/261 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2025-01-09 21:39:41,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 762 flow [2025-01-09 21:39:41,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:39:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:39:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2025-01-09 21:39:41,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9448275862068966 [2025-01-09 21:39:41,833 INFO L175 Difference]: Start difference. First operand has 279 places, 309 transitions, 941 flow. Second operand 5 states and 1233 transitions. [2025-01-09 21:39:41,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 762 flow [2025-01-09 21:39:41,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 716 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-01-09 21:39:41,847 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 679 flow [2025-01-09 21:39:41,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-01-09 21:39:41,848 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2025-01-09 21:39:41,851 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 679 flow [2025-01-09 21:39:41,852 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) [2025-01-09 21:39:41,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:41,852 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:41,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:39:41,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:41,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 654296306, now seen corresponding path program 1 times [2025-01-09 21:39:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-01-09 21:39:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:41,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 21:39:41,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 21:39:41,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:41,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-01-09 21:39:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113205323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:41,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467271956] [2025-01-09 21:39:41,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:41,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:41,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:41,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:41,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-01-09 21:39:41,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:41,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:41,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-01-09 21:39:41,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:42,462 INFO L124 PetriNetUnfolderBase]: 1083/4561 cut-off events. [2025-01-09 21:39:42,462 INFO L125 PetriNetUnfolderBase]: For 1579/1591 co-relation queries the response was YES. [2025-01-09 21:39:42,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4561 events. 1083/4561 cut-off events. For 1579/1591 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 43883 event pairs, 573 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 8187. Up to 1492 conditions per place. [2025-01-09 21:39:42,484 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2025-01-09 21:39:42,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 286 transitions, 831 flow [2025-01-09 21:39:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-01-09 21:39:42,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527458492975734 [2025-01-09 21:39:42,486 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 679 flow. Second operand 3 states and 746 transitions. [2025-01-09 21:39:42,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 286 transitions, 831 flow [2025-01-09 21:39:42,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 286 transitions, 810 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:39:42,491 INFO L231 Difference]: Finished difference. Result has 274 places, 276 transitions, 748 flow [2025-01-09 21:39:42,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=274, PETRI_TRANSITIONS=276} [2025-01-09 21:39:42,492 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-01-09 21:39:42,492 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 276 transitions, 748 flow [2025-01-09 21:39:42,492 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) [2025-01-09 21:39:42,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:42,493 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:42,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:39:42,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:42,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash 62187179, now seen corresponding path program 1 times [2025-01-09 21:39:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:42,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424539581] [2025-01-09 21:39:42,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:39:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:39:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:42,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424539581] [2025-01-09 21:39:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424539581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:42,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:39:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262080686] [2025-01-09 21:39:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:42,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:42,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:42,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:42,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 261 [2025-01-09 21:39:42,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:42,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:42,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 261 [2025-01-09 21:39:42,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:43,181 INFO L124 PetriNetUnfolderBase]: 646/4598 cut-off events. [2025-01-09 21:39:43,181 INFO L125 PetriNetUnfolderBase]: For 1809/1980 co-relation queries the response was YES. [2025-01-09 21:39:43,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 4598 events. 646/4598 cut-off events. For 1809/1980 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 48853 event pairs, 112 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 7189. Up to 698 conditions per place. [2025-01-09 21:39:43,206 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 21 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2025-01-09 21:39:43,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 849 flow [2025-01-09 21:39:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2025-01-09 21:39:43,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680715197956578 [2025-01-09 21:39:43,208 INFO L175 Difference]: Start difference. First operand has 274 places, 276 transitions, 748 flow. Second operand 3 states and 758 transitions. [2025-01-09 21:39:43,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 849 flow [2025-01-09 21:39:43,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:43,216 INFO L231 Difference]: Finished difference. Result has 275 places, 283 transitions, 788 flow [2025-01-09 21:39:43,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=275, PETRI_TRANSITIONS=283} [2025-01-09 21:39:43,216 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2025-01-09 21:39:43,216 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 283 transitions, 788 flow [2025-01-09 21:39:43,217 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) [2025-01-09 21:39:43,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:43,217 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:43,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:39:43,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:43,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash -854270631, now seen corresponding path program 2 times [2025-01-09 21:39:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048303070] [2025-01-09 21:39:43,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:39:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:43,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:39:43,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:39:43,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:39:43,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:43,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048303070] [2025-01-09 21:39:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048303070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:39:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289097395] [2025-01-09 21:39:43,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:43,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:39:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:43,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:39:43,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:39:43,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-01-09 21:39:43,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 283 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:43,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:43,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-01-09 21:39:43,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:43,767 INFO L124 PetriNetUnfolderBase]: 302/2783 cut-off events. [2025-01-09 21:39:43,767 INFO L125 PetriNetUnfolderBase]: For 987/1190 co-relation queries the response was YES. [2025-01-09 21:39:43,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 2783 events. 302/2783 cut-off events. For 987/1190 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 24952 event pairs, 83 based on Foata normal form. 61/2744 useless extension candidates. Maximal degree in co-relation 4430. Up to 326 conditions per place. [2025-01-09 21:39:43,779 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 28 selfloop transitions, 8 changer transitions 0/289 dead transitions. [2025-01-09 21:39:43,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 289 transitions, 867 flow [2025-01-09 21:39:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:39:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:39:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1236 transitions. [2025-01-09 21:39:43,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471264367816092 [2025-01-09 21:39:43,781 INFO L175 Difference]: Start difference. First operand has 275 places, 283 transitions, 788 flow. Second operand 5 states and 1236 transitions. [2025-01-09 21:39:43,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 289 transitions, 867 flow [2025-01-09 21:39:43,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 854 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:39:43,785 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 751 flow [2025-01-09 21:39:43,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2025-01-09 21:39:43,786 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2025-01-09 21:39:43,786 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 751 flow [2025-01-09 21:39:43,787 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) [2025-01-09 21:39:43,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:43,787 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:39:43,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:43,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1305262714, now seen corresponding path program 1 times [2025-01-09 21:39:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571151832] [2025-01-09 21:39:43,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:43,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:39:43,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:39:43,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:43,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571151832] [2025-01-09 21:39:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571151832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293418688] [2025-01-09 21:39:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:43,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:43,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:43,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:43,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-01-09 21:39:43,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:39:43,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:43,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-01-09 21:39:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:44,135 INFO L124 PetriNetUnfolderBase]: 503/3564 cut-off events. [2025-01-09 21:39:44,135 INFO L125 PetriNetUnfolderBase]: For 2170/2436 co-relation queries the response was YES. [2025-01-09 21:39:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 3564 events. 503/3564 cut-off events. For 2170/2436 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 34372 event pairs, 226 based on Foata normal form. 6/3415 useless extension candidates. Maximal degree in co-relation 6345. Up to 891 conditions per place. [2025-01-09 21:39:44,149 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 37 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-01-09 21:39:44,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 845 flow [2025-01-09 21:39:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2025-01-09 21:39:44,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-01-09 21:39:44,151 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 751 flow. Second operand 3 states and 725 transitions. [2025-01-09 21:39:44,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 845 flow [2025-01-09 21:39:44,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 280 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:39:44,156 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 744 flow [2025-01-09 21:39:44,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2025-01-09 21:39:44,156 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2025-01-09 21:39:44,156 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 744 flow [2025-01-09 21:39:44,157 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) [2025-01-09 21:39:44,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:44,157 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:39:44,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:39:44,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:44,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1238471515, now seen corresponding path program 1 times [2025-01-09 21:39:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229453690] [2025-01-09 21:39:44,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:44,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:39:44,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:39:44,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:44,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:44,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:44,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229453690] [2025-01-09 21:39:44,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229453690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:44,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:44,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:39:44,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007607778] [2025-01-09 21:39:44,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:44,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:39:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:44,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:39:44,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:39:44,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 261 [2025-01-09 21:39:44,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 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) [2025-01-09 21:39:44,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:44,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 261 [2025-01-09 21:39:44,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:44,597 INFO L124 PetriNetUnfolderBase]: 323/2280 cut-off events. [2025-01-09 21:39:44,597 INFO L125 PetriNetUnfolderBase]: For 1006/1071 co-relation queries the response was YES. [2025-01-09 21:39:44,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4455 conditions, 2280 events. 323/2280 cut-off events. For 1006/1071 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 17563 event pairs, 78 based on Foata normal form. 22/2223 useless extension candidates. Maximal degree in co-relation 3225. Up to 288 conditions per place. [2025-01-09 21:39:44,606 INFO L140 encePairwiseOnDemand]: 254/261 looper letters, 70 selfloop transitions, 14 changer transitions 12/329 dead transitions. [2025-01-09 21:39:44,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 329 transitions, 1153 flow [2025-01-09 21:39:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:39:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:39:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2174 transitions. [2025-01-09 21:39:44,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9255002128565347 [2025-01-09 21:39:44,609 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 744 flow. Second operand 9 states and 2174 transitions. [2025-01-09 21:39:44,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 329 transitions, 1153 flow [2025-01-09 21:39:44,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 329 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:39:44,615 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 787 flow [2025-01-09 21:39:44,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=284, PETRI_TRANSITIONS=278} [2025-01-09 21:39:44,615 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 21 predicate places. [2025-01-09 21:39:44,615 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 787 flow [2025-01-09 21:39:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 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) [2025-01-09 21:39:44,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:44,616 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:44,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:39:44,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-01-09 21:39:44,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash -912301016, now seen corresponding path program 1 times [2025-01-09 21:39:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:44,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928511339] [2025-01-09 21:39:44,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:39:44,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:39:44,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:44,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:44,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:39:44,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:39:44,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:39:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:39:44,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:39:44,715 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:39:44,715 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-01-09 21:39:44,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-01-09 21:39:44,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-01-09 21:39:44,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-01-09 21:39:44,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-01-09 21:39:44,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-01-09 21:39:44,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-01-09 21:39:44,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-01-09 21:39:44,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-01-09 21:39:44,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-01-09 21:39:44,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-01-09 21:39:44,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-01-09 21:39:44,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-01-09 21:39:44,717 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-01-09 21:39:44,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:39:44,717 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:44,719 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:39:44,719 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:39:44,746 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:39:44,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 291 transitions, 600 flow [2025-01-09 21:39:44,789 INFO L124 PetriNetUnfolderBase]: 9/430 cut-off events. [2025-01-09 21:39:44,790 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:39:44,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 430 events. 9/430 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 571 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 355. Up to 8 conditions per place. [2025-01-09 21:39:44,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 291 transitions, 600 flow [2025-01-09 21:39:44,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 291 transitions, 600 flow [2025-01-09 21:39:44,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:39:44,794 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;@7ce5f215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:39:44,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-09 21:39:44,803 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:39:44,803 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-01-09 21:39:44,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:39:44,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:44,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:44,803 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)] === [2025-01-09 21:39:44,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1170954261, now seen corresponding path program 1 times [2025-01-09 21:39:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781478856] [2025-01-09 21:39:44,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:44,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:39:44,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:39:44,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:44,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781478856] [2025-01-09 21:39:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781478856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:44,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:44,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535920529] [2025-01-09 21:39:44,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:44,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:44,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:44,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:44,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 291 [2025-01-09 21:39:44,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 291 transitions, 600 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) [2025-01-09 21:39:44,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:44,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 291 [2025-01-09 21:39:44,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:52,731 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2025-01-09 21:39:52,731 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2025-01-09 21:39:53,113 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 2945. Compared 957099 event pairs, 14941 based on Foata normal form. 1/71001 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2025-01-09 21:39:53,359 INFO L140 encePairwiseOnDemand]: 270/291 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2025-01-09 21:39:53,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2025-01-09 21:39:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:39:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:39:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2025-01-09 21:39:53,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9495990836197021 [2025-01-09 21:39:53,361 INFO L175 Difference]: Start difference. First operand has 295 places, 291 transitions, 600 flow. Second operand 3 states and 829 transitions. [2025-01-09 21:39:53,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2025-01-09 21:39:53,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-09 21:39:53,366 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2025-01-09 21:39:53,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, 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} [2025-01-09 21:39:53,367 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2025-01-09 21:39:53,367 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2025-01-09 21:39:53,368 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) [2025-01-09 21:39:53,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:39:53,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:39:53,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:39:53,368 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)] === [2025-01-09 21:39:53,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:39:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 651523239, now seen corresponding path program 1 times [2025-01-09 21:39:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:39:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973793570] [2025-01-09 21:39:53,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:39:53,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:39:53,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:39:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:39:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:39:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:39:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:39:53,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:39:53,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973793570] [2025-01-09 21:39:53,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973793570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:39:53,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:39:53,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:39:53,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712589863] [2025-01-09 21:39:53,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:39:53,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:39:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:39:53,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:39:53,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:39:53,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 291 [2025-01-09 21:39:53,434 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) [2025-01-09 21:39:53,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:39:53,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 291 [2025-01-09 21:39:53,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:39:57,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 35#L691-3true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:39:57,186 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 35#L691-3true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:39:57,186 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [303#true, 292#true, 35#L691-3true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:39:57,186 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:57,186 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:57,374 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 35#L691-3true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:39:57,374 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:39:57,374 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:39:57,375 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,375 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,375 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,376 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [303#true, 292#true, 35#L691-3true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:39:57,376 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-01-09 21:39:57,376 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,376 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-01-09 21:39:57,376 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,376 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:39:57,584 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 35#L691-3true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:39:57,584 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-01-09 21:39:57,584 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:57,584 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-01-09 21:39:57,584 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:57,585 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:57,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 294#true, 35#L691-3true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:39:57,585 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-01-09 21:39:57,585 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:57,585 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-01-09 21:39:57,585 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:39:58,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [292#true, 303#true, 294#true, 35#L691-3true, 103#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:39:58,360 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-01-09 21:39:58,360 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:39:58,360 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-01-09 21:39:58,360 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-01-09 21:39:58,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 292#true, 303#true, 35#L691-3true, 294#true, 300#(= |#race~threads_alive~0| 0), 45#L695-5true, 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:39:58,361 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-01-09 21:39:58,361 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-01-09 21:39:58,362 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:39:58,362 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-01-09 21:39:59,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [292#true, 303#true, 294#true, 35#L691-3true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:39:59,260 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-01-09 21:39:59,260 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-01-09 21:39:59,260 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:39:59,260 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-01-09 21:39:59,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 303#true, 292#true, 35#L691-3true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:39:59,263 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-01-09 21:39:59,263 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-01-09 21:39:59,263 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:39:59,263 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-01-09 21:39:59,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [156#L693-3true, 292#true, 303#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:39:59,821 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [156#L693-3true, 292#true, 303#true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:39:59,821 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [156#L693-3true, 292#true, 303#true, 294#true, 221#L695-2true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:39:59,821 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-01-09 21:39:59,821 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:39:59,822 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:39:59,822 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:00,121 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [156#L693-3true, 292#true, 303#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:40:00,121 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:40:00,121 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:00,121 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:00,121 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:00,121 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:00,124 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [156#L693-3true, 303#true, 292#true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:40:00,124 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-01-09 21:40:00,124 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:00,124 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:00,124 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:40:00,124 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-01-09 21:40:00,559 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [156#L693-3true, 292#true, 303#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:40:00,560 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [156#L693-3true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:40:00,560 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:00,560 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 294#true, 79#L695-1true, 300#(= |#race~threads_alive~0| 0), 238#L695-2true, 296#true, Black: 298#true, 219#L712-1true, 261#L694-3true]) [2025-01-09 21:40:00,562 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [303#true, 292#true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true, 261#L694-3true]) [2025-01-09 21:40:00,562 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,562 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [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, 261#L694-3true]) [2025-01-09 21:40:00,563 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-01-09 21:40:00,563 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,563 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,563 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,761 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 79#L695-1true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true, 261#L694-3true]) [2025-01-09 21:40:00,761 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:00,761 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,761 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:00,761 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,761 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,763 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 221#L695-2true, 294#true, 135#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 219#L712-1true, Black: 298#true, 261#L694-3true]) [2025-01-09 21:40:00,763 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-01-09 21:40:00,763 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,763 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,763 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:00,763 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:40:00,989 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1055] L713-5-->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][170], [292#true, 303#true, 221#L695-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 238#L695-2true, 219#L712-1true, Black: 298#true, 261#L694-3true]) [2025-01-09 21:40:00,989 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [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, 261#L694-3true]) [2025-01-09 21:40:00,990 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-01-09 21:40:00,990 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-01-09 21:40:01,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [156#L693-3true, 303#true, 292#true, 294#true, 103#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:40:01,237 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-01-09 21:40:01,237 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-01-09 21:40:01,237 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:01,237 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-01-09 21:40:01,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 156#L693-3true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 45#L695-5true, 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:40:01,240 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-01-09 21:40:01,240 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-01-09 21:40:01,240 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-01-09 21:40:01,240 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:01,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 103#L695-5true, 296#true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 261#L694-3true]) [2025-01-09 21:40:01,880 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-01-09 21:40:01,881 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:01,881 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:40:01,881 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:01,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 45#L695-5true, 296#true, Black: 298#true, 219#L712-1true, 261#L694-3true]) [2025-01-09 21:40:01,883 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-01-09 21:40:01,883 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:40:01,883 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:01,883 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-01-09 21:40:02,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [156#L693-3true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 245#L697-3true, Black: 298#true, 219#L712-1true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:40:02,099 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-01-09 21:40:02,099 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-01-09 21:40:02,099 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:02,099 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:02,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [146#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 124#L697-3true, 156#L693-3true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:40:02,101 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-01-09 21:40:02,101 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:02,101 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-01-09 21:40:02,102 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-01-09 21:40:02,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [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, 261#L694-3true]) [2025-01-09 21:40:02,739 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-01-09 21:40:02,739 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:40:02,739 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:02,739 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:02,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [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, 261#L694-3true]) [2025-01-09 21:40:02,742 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-01-09 21:40:02,742 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:02,742 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-01-09 21:40:02,742 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:40:04,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [124#L697-3true, 303#true, 292#true, 157#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, Black: 298#true, 219#L712-1true]) [2025-01-09 21:40:04,104 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-01-09 21:40:04,104 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-01-09 21:40:04,104 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:40:04,104 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:40:04,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 245#L697-3true, 296#true, Black: 298#true, 219#L712-1true, 272#L697-3true, 217#threadErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2025-01-09 21:40:04,105 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-01-09 21:40:04,105 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:40:04,105 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-01-09 21:40:04,105 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:40:04,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][157], [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, 272#L697-3true]) [2025-01-09 21:40:04,108 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-01-09 21:40:04,108 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-01-09 21:40:04,108 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:40:04,108 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:40:04,319 INFO L124 PetriNetUnfolderBase]: 38618/99725 cut-off events. [2025-01-09 21:40:04,319 INFO L125 PetriNetUnfolderBase]: For 39987/44110 co-relation queries the response was YES. [2025-01-09 21:40:04,720 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 3188. Compared 1332800 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. [2025-01-09 21:40:05,131 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 55 selfloop transitions, 16 changer transitions 0/328 dead transitions. [2025-01-09 21:40:05,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 328 transitions, 944 flow [2025-01-09 21:40:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:40:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:40:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-01-09 21:40:05,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2025-01-09 21:40:05,133 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 714 flow. Second operand 3 states and 816 transitions. [2025-01-09 21:40:05,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 328 transitions, 944 flow [2025-01-09 21:40:05,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 328 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:40:05,282 INFO L231 Difference]: Finished difference. Result has 300 places, 316 transitions, 832 flow [2025-01-09 21:40:05,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, 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} [2025-01-09 21:40:05,283 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 5 predicate places. [2025-01-09 21:40:05,283 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 316 transitions, 832 flow [2025-01-09 21:40:05,283 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) [2025-01-09 21:40:05,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:40:05,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:40:05,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:40:05,284 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)] === [2025-01-09 21:40:05,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:40:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1689646711, now seen corresponding path program 1 times [2025-01-09 21:40:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:40:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181356082] [2025-01-09 21:40:05,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:40:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:40:05,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 21:40:05,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 21:40:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:40:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:40:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:40:05,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:40:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181356082] [2025-01-09 21:40:05,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181356082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:40:05,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:40:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:40:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954089971] [2025-01-09 21:40:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:40:05,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:40:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:40:05,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:40:05,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:40:05,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 291 [2025-01-09 21:40:05,346 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) [2025-01-09 21:40:05,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:40:05,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 291 [2025-01-09 21:40:05,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:40:08,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 303#true, 292#true, 79#L695-1true, 294#true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:40:08,729 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-01-09 21:40:08,729 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:08,729 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:08,729 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:08,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 303#true, 292#true, 221#L695-2true, 294#true, 135#L695-1true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:40:08,730 INFO L294 olderBase$Statistics]: this new event has 273 ancestors and is cut-off event [2025-01-09 21:40:08,730 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:08,730 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:08,730 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:40:08,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1055] L713-5-->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][170], [308#true, Black: 305#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 303#true, 292#true, 221#L695-2true, 294#true, 238#L695-2true, 187#$Ultimate##0true, 296#true, 219#L712-1true, Black: 298#true]) [2025-01-09 21:40:08,972 INFO L294 olderBase$Statistics]: this new event has 274 ancestors and is cut-off event [2025-01-09 21:40:08,972 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-01-09 21:40:08,972 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-01-09 21:40:08,972 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event