./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b78611c293a7a651605e3dc9bdfe409b46ee0a572a0a5030b4011d70f271b607 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:30:11,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:30:11,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:30:11,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:30:11,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:30:11,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:30:11,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:30:11,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:30:11,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:30:11,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:30:11,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:30:11,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:30:11,225 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:30:11,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:30:11,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:30:11,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:30:11,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:11,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:30:11,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:11,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:30:11,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:30:11,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:30:11,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:30:11,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:30:11,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:30:11,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:30:11,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:30:11,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:30:11,229 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/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 -> b78611c293a7a651605e3dc9bdfe409b46ee0a572a0a5030b4011d70f271b607 [2025-04-30 10:30:11,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:30:11,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:30:11,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:30:11,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:30:11,486 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:30:11,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race.i [2025-04-30 10:30:12,814 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a75fc3de/8e1e408dd1cb4c0ab4b6d653abd23060/FLAGa79841128 [2025-04-30 10:30:13,035 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:30:13,035 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race.i [2025-04-30 10:30:13,043 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a75fc3de/8e1e408dd1cb4c0ab4b6d653abd23060/FLAGa79841128 [2025-04-30 10:30:13,864 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a75fc3de/8e1e408dd1cb4c0ab4b6d653abd23060 [2025-04-30 10:30:13,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:30:13,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:30:13,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:30:13,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:30:13,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:30:13,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:30:13" (1/1) ... [2025-04-30 10:30:13,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ad4152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:13, skipping insertion in model container [2025-04-30 10:30:13,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:30:13" (1/1) ... [2025-04-30 10:30:13,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:30:14,118 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:30:14,129 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:30:14,170 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:30:14,197 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:30:14,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14 WrapperNode [2025-04-30 10:30:14,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:30:14,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:30:14,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:30:14,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:30:14,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,235 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2025-04-30 10:30:14,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:30:14,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:30:14,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:30:14,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:30:14,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:30:14,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:30:14,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:30:14,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:30:14,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (1/1) ... [2025-04-30 10:30:14,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:30:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:30:14,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:30:14,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:30:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:30:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:30:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:30:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:30:14,317 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:30:14,397 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:30:14,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:30:14,545 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:30:14,545 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:30:14,556 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:30:14,556 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:30:14,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:14 BoogieIcfgContainer [2025-04-30 10:30:14,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:30:14,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:30:14,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:30:14,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:30:14,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:30:13" (1/3) ... [2025-04-30 10:30:14,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4d4de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:30:14, skipping insertion in model container [2025-04-30 10:30:14,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:30:14" (2/3) ... [2025-04-30 10:30:14,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4d4de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:30:14, skipping insertion in model container [2025-04-30 10:30:14,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:14" (3/3) ... [2025-04-30 10:30:14,563 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i [2025-04-30 10:30:14,573 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:30:14,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race.i that has 2 procedures, 76 locations, 76 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-30 10:30:14,576 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:30:14,619 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:30:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 161 flow [2025-04-30 10:30:14,682 INFO L116 PetriNetUnfolderBase]: 1/110 cut-off events. [2025-04-30 10:30:14,686 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:30:14,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 1/110 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 210 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 4. Up to 3 conditions per place. [2025-04-30 10:30:14,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 77 transitions, 161 flow [2025-04-30 10:30:14,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 77 transitions, 161 flow [2025-04-30 10:30:14,696 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:14,709 INFO L340 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;@208d5e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:14,709 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:30:14,715 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:14,715 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:14,715 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:14,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:14,715 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] [2025-04-30 10:30:14,716 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:14,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash -435345755, now seen corresponding path program 1 times [2025-04-30 10:30:14,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:14,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839119244] [2025-04-30 10:30:14,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:14,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:14,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:14,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:14,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:14,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:14,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:14,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839119244] [2025-04-30 10:30:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839119244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:14,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350967535] [2025-04-30 10:30:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:14,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:14,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:14,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:14,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:15,019 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 77 [2025-04-30 10:30:15,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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-04-30 10:30:15,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 77 [2025-04-30 10:30:15,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,107 INFO L116 PetriNetUnfolderBase]: 8/187 cut-off events. [2025-04-30 10:30:15,108 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:30:15,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 187 events. 8/187 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 570 event pairs, 0 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2025-04-30 10:30:15,110 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 10 selfloop transitions, 4 changer transitions 1/81 dead transitions. [2025-04-30 10:30:15,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 199 flow [2025-04-30 10:30:15,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2025-04-30 10:30:15,124 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-04-30 10:30:15,126 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 161 flow. Second operand 4 states and 280 transitions. [2025-04-30 10:30:15,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 199 flow [2025-04-30 10:30:15,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:15,134 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 173 flow [2025-04-30 10:30:15,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2025-04-30 10:30:15,140 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-04-30 10:30:15,142 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 173 flow [2025-04-30 10:30:15,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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-04-30 10:30:15,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,143 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] [2025-04-30 10:30:15,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:30:15,143 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:15,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1878811919, now seen corresponding path program 1 times [2025-04-30 10:30:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030637587] [2025-04-30 10:30:15,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:15,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:15,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:15,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:15,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030637587] [2025-04-30 10:30:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030637587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:15,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365493548] [2025-04-30 10:30:15,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:15,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:15,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:15,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:15,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 77 [2025-04-30 10:30:15,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:15,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 77 [2025-04-30 10:30:15,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,759 INFO L116 PetriNetUnfolderBase]: 30/231 cut-off events. [2025-04-30 10:30:15,759 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-30 10:30:15,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 231 events. 30/231 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 924 event pairs, 11 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 268. Up to 62 conditions per place. [2025-04-30 10:30:15,762 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 25 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-04-30 10:30:15,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 247 flow [2025-04-30 10:30:15,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 355 transitions. [2025-04-30 10:30:15,764 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7683982683982684 [2025-04-30 10:30:15,764 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 173 flow. Second operand 6 states and 355 transitions. [2025-04-30 10:30:15,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 247 flow [2025-04-30 10:30:15,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:15,765 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 173 flow [2025-04-30 10:30:15,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2025-04-30 10:30:15,766 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2025-04-30 10:30:15,766 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 173 flow [2025-04-30 10:30:15,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:15,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,768 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] [2025-04-30 10:30:15,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:30:15,769 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:15,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash 874120931, now seen corresponding path program 1 times [2025-04-30 10:30:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200495179] [2025-04-30 10:30:15,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:15,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:15,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:15,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200495179] [2025-04-30 10:30:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200495179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:15,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:15,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32902446] [2025-04-30 10:30:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:15,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:15,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:15,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:15,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 77 [2025-04-30 10:30:15,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-04-30 10:30:15,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 77 [2025-04-30 10:30:15,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,848 INFO L116 PetriNetUnfolderBase]: 6/143 cut-off events. [2025-04-30 10:30:15,849 INFO L117 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-04-30 10:30:15,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 143 events. 6/143 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 4 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2025-04-30 10:30:15,849 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 9 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-04-30 10:30:15,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 205 flow [2025-04-30 10:30:15,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-04-30 10:30:15,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2025-04-30 10:30:15,851 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 173 flow. Second operand 3 states and 215 transitions. [2025-04-30 10:30:15,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 205 flow [2025-04-30 10:30:15,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:15,852 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 193 flow [2025-04-30 10:30:15,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-04-30 10:30:15,853 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-04-30 10:30:15,853 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 193 flow [2025-04-30 10:30:15,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-04-30 10:30:15,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,853 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] [2025-04-30 10:30:15,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:30:15,854 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:15,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash -317364517, now seen corresponding path program 1 times [2025-04-30 10:30:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338433309] [2025-04-30 10:30:15,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:15,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:15,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:15,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:15,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:15,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:15,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338433309] [2025-04-30 10:30:15,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338433309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:15,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:15,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392063142] [2025-04-30 10:30:15,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:15,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:15,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:15,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:15,957 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 77 [2025-04-30 10:30:15,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-04-30 10:30:15,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:15,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 77 [2025-04-30 10:30:15,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:15,981 INFO L116 PetriNetUnfolderBase]: 2/108 cut-off events. [2025-04-30 10:30:15,981 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:30:15,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 108 events. 2/108 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 154 event pairs, 0 based on Foata normal form. 3/106 useless extension candidates. Maximal degree in co-relation 83. Up to 7 conditions per place. [2025-04-30 10:30:15,982 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 9 selfloop transitions, 3 changer transitions 7/77 dead transitions. [2025-04-30 10:30:15,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 203 flow [2025-04-30 10:30:15,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2025-04-30 10:30:15,984 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9025974025974026 [2025-04-30 10:30:15,985 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 193 flow. Second operand 4 states and 278 transitions. [2025-04-30 10:30:15,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 203 flow [2025-04-30 10:30:15,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-30 10:30:15,987 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 157 flow [2025-04-30 10:30:15,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-04-30 10:30:15,988 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-04-30 10:30:15,989 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 157 flow [2025-04-30 10:30:15,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-04-30 10:30:15,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:15,989 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] [2025-04-30 10:30:15,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:30:15,989 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:15,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:15,990 INFO L85 PathProgramCache]: Analyzing trace with hash 461962144, now seen corresponding path program 1 times [2025-04-30 10:30:15,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:15,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435142955] [2025-04-30 10:30:15,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:15,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:16,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:16,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:16,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:16,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:16,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:16,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435142955] [2025-04-30 10:30:16,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435142955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:16,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:16,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694347244] [2025-04-30 10:30:16,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:16,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:16,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:16,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:16,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-04-30 10:30:16,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-04-30 10:30:16,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:16,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-04-30 10:30:16,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:16,192 INFO L116 PetriNetUnfolderBase]: 6/95 cut-off events. [2025-04-30 10:30:16,192 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:30:16,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 95 events. 6/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 122. Up to 5 conditions per place. [2025-04-30 10:30:16,193 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 10 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-04-30 10:30:16,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 146 flow [2025-04-30 10:30:16,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 464 transitions. [2025-04-30 10:30:16,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8608534322820037 [2025-04-30 10:30:16,194 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 157 flow. Second operand 7 states and 464 transitions. [2025-04-30 10:30:16,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 146 flow [2025-04-30 10:30:16,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:16,195 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2025-04-30 10:30:16,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-04-30 10:30:16,196 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2025-04-30 10:30:16,196 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2025-04-30 10:30:16,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-04-30 10:30:16,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:16,197 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:16,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:30:16,197 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-30 10:30:16,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1534161632, now seen corresponding path program 1 times [2025-04-30 10:30:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:16,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909468860] [2025-04-30 10:30:16,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:16,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:30:16,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:30:16,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:16,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:16,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:16,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:30:16,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:30:16,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:16,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:16,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:16,247 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:16,247 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-30 10:30:16,248 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-30 10:30:16,249 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-30 10:30:16,249 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-30 10:30:16,249 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-30 10:30:16,250 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-30 10:30:16,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:30:16,250 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:30:16,251 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:16,252 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:30:16,265 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:30:16,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 95 transitions, 206 flow [2025-04-30 10:30:16,281 INFO L116 PetriNetUnfolderBase]: 3/196 cut-off events. [2025-04-30 10:30:16,282 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:30:16,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 196 events. 3/196 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 460 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2025-04-30 10:30:16,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 95 transitions, 206 flow [2025-04-30 10:30:16,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 206 flow [2025-04-30 10:30:16,283 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:16,284 INFO L340 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;@208d5e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:16,284 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:30:16,288 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:16,288 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:16,288 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:16,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:16,288 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] [2025-04-30 10:30:16,289 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:16,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1504386747, now seen corresponding path program 1 times [2025-04-30 10:30:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:16,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891239705] [2025-04-30 10:30:16,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:16,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:16,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:16,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:16,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:16,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891239705] [2025-04-30 10:30:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891239705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:16,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702584301] [2025-04-30 10:30:16,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:16,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:16,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:16,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:16,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:16,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:16,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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-04-30 10:30:16,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:16,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:16,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:16,435 INFO L116 PetriNetUnfolderBase]: 72/621 cut-off events. [2025-04-30 10:30:16,435 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-30 10:30:16,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 621 events. 72/621 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3700 event pairs, 20 based on Foata normal form. 1/566 useless extension candidates. Maximal degree in co-relation 215. Up to 106 conditions per place. [2025-04-30 10:30:16,439 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 18 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-04-30 10:30:16,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 264 flow [2025-04-30 10:30:16,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2025-04-30 10:30:16,441 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9026315789473685 [2025-04-30 10:30:16,441 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 206 flow. Second operand 4 states and 343 transitions. [2025-04-30 10:30:16,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 264 flow [2025-04-30 10:30:16,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:16,442 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 222 flow [2025-04-30 10:30:16,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2025-04-30 10:30:16,443 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-04-30 10:30:16,443 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 222 flow [2025-04-30 10:30:16,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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-04-30 10:30:16,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:16,443 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] [2025-04-30 10:30:16,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:30:16,445 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:16,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1261213422, now seen corresponding path program 1 times [2025-04-30 10:30:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:16,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013619437] [2025-04-30 10:30:16,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:16,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:16,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:16,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:16,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013619437] [2025-04-30 10:30:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013619437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:16,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:16,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115217277] [2025-04-30 10:30:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:16,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:16,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:16,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:16,701 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 95 [2025-04-30 10:30:16,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-04-30 10:30:16,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:16,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 95 [2025-04-30 10:30:16,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:16,858 INFO L116 PetriNetUnfolderBase]: 236/966 cut-off events. [2025-04-30 10:30:16,859 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-30 10:30:16,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 966 events. 236/966 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6801 event pairs, 34 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 457. Up to 313 conditions per place. [2025-04-30 10:30:16,864 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 38 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2025-04-30 10:30:16,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 338 flow [2025-04-30 10:30:16,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2025-04-30 10:30:16,866 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7912280701754386 [2025-04-30 10:30:16,866 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 222 flow. Second operand 6 states and 451 transitions. [2025-04-30 10:30:16,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 338 flow [2025-04-30 10:30:16,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 111 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:16,868 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 224 flow [2025-04-30 10:30:16,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2025-04-30 10:30:16,869 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2025-04-30 10:30:16,869 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 224 flow [2025-04-30 10:30:16,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-04-30 10:30:16,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:16,869 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] [2025-04-30 10:30:16,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:30:16,869 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:16,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 326716242, now seen corresponding path program 1 times [2025-04-30 10:30:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:16,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581684467] [2025-04-30 10:30:16,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:16,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:16,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:16,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:16,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:16,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:16,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581684467] [2025-04-30 10:30:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581684467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813339537] [2025-04-30 10:30:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:16,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:16,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:16,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:16,915 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:16,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-04-30 10:30:16,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:16,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:16,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:16,993 INFO L116 PetriNetUnfolderBase]: 113/682 cut-off events. [2025-04-30 10:30:16,994 INFO L117 PetriNetUnfolderBase]: For 97/142 co-relation queries the response was YES. [2025-04-30 10:30:16,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 682 events. 113/682 cut-off events. For 97/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4292 event pairs, 73 based on Foata normal form. 3/606 useless extension candidates. Maximal degree in co-relation 734. Up to 182 conditions per place. [2025-04-30 10:30:16,997 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 18 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-04-30 10:30:16,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 103 transitions, 294 flow [2025-04-30 10:30:16,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-04-30 10:30:16,998 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9263157894736842 [2025-04-30 10:30:16,998 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 224 flow. Second operand 3 states and 264 transitions. [2025-04-30 10:30:16,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 103 transitions, 294 flow [2025-04-30 10:30:16,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 284 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:17,000 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 252 flow [2025-04-30 10:30:17,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2025-04-30 10:30:17,000 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2025-04-30 10:30:17,000 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 252 flow [2025-04-30 10:30:17,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-04-30 10:30:17,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,001 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] [2025-04-30 10:30:17,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:30:17,001 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:17,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash -914654326, now seen corresponding path program 1 times [2025-04-30 10:30:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461615625] [2025-04-30 10:30:17,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:17,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:17,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:17,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461615625] [2025-04-30 10:30:17,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461615625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:17,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:17,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980505881] [2025-04-30 10:30:17,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:17,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:17,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:17,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:17,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:17,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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-04-30 10:30:17,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:17,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:17,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:17,177 INFO L116 PetriNetUnfolderBase]: 57/561 cut-off events. [2025-04-30 10:30:17,177 INFO L117 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-04-30 10:30:17,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 561 events. 57/561 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3012 event pairs, 20 based on Foata normal form. 15/532 useless extension candidates. Maximal degree in co-relation 618. Up to 66 conditions per place. [2025-04-30 10:30:17,182 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 20 selfloop transitions, 4 changer transitions 2/110 dead transitions. [2025-04-30 10:30:17,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 110 transitions, 332 flow [2025-04-30 10:30:17,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-04-30 10:30:17,183 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9131578947368421 [2025-04-30 10:30:17,183 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 252 flow. Second operand 4 states and 347 transitions. [2025-04-30 10:30:17,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 110 transitions, 332 flow [2025-04-30 10:30:17,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 110 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:17,186 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 258 flow [2025-04-30 10:30:17,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-04-30 10:30:17,187 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2025-04-30 10:30:17,188 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 258 flow [2025-04-30 10:30:17,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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-04-30 10:30:17,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,189 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] [2025-04-30 10:30:17,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:30:17,189 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:17,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,189 INFO L85 PathProgramCache]: Analyzing trace with hash 650863888, now seen corresponding path program 1 times [2025-04-30 10:30:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520261996] [2025-04-30 10:30:17,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:17,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:17,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:17,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520261996] [2025-04-30 10:30:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520261996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:17,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:17,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240075842] [2025-04-30 10:30:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:17,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:17,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:17,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:17,329 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2025-04-30 10:30:17,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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-04-30 10:30:17,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:17,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2025-04-30 10:30:17,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:17,463 INFO L116 PetriNetUnfolderBase]: 117/892 cut-off events. [2025-04-30 10:30:17,463 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-30 10:30:17,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 892 events. 117/892 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5614 event pairs, 16 based on Foata normal form. 3/814 useless extension candidates. Maximal degree in co-relation 765. Up to 130 conditions per place. [2025-04-30 10:30:17,467 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 24 selfloop transitions, 7 changer transitions 3/116 dead transitions. [2025-04-30 10:30:17,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 358 flow [2025-04-30 10:30:17,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 581 transitions. [2025-04-30 10:30:17,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2025-04-30 10:30:17,469 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 258 flow. Second operand 7 states and 581 transitions. [2025-04-30 10:30:17,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 358 flow [2025-04-30 10:30:17,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 116 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:17,472 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 282 flow [2025-04-30 10:30:17,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2025-04-30 10:30:17,473 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2025-04-30 10:30:17,474 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 282 flow [2025-04-30 10:30:17,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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-04-30 10:30:17,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,474 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:17,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:30:17,475 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:17,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash 727822940, now seen corresponding path program 1 times [2025-04-30 10:30:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202682461] [2025-04-30 10:30:17,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:17,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:17,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:17,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202682461] [2025-04-30 10:30:17,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202682461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:17,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:17,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:17,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802298354] [2025-04-30 10:30:17,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:17,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:17,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:17,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:17,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-04-30 10:30:17,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-04-30 10:30:17,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:17,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-04-30 10:30:17,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:17,590 INFO L116 PetriNetUnfolderBase]: 58/596 cut-off events. [2025-04-30 10:30:17,590 INFO L117 PetriNetUnfolderBase]: For 132/185 co-relation queries the response was YES. [2025-04-30 10:30:17,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 596 events. 58/596 cut-off events. For 132/185 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3456 event pairs, 32 based on Foata normal form. 3/552 useless extension candidates. Maximal degree in co-relation 784. Up to 111 conditions per place. [2025-04-30 10:30:17,593 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 18 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-04-30 10:30:17,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 109 transitions, 351 flow [2025-04-30 10:30:17,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-04-30 10:30:17,594 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2025-04-30 10:30:17,594 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 282 flow. Second operand 3 states and 263 transitions. [2025-04-30 10:30:17,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 109 transitions, 351 flow [2025-04-30 10:30:17,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 341 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:17,596 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 318 flow [2025-04-30 10:30:17,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2025-04-30 10:30:17,597 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2025-04-30 10:30:17,597 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 318 flow [2025-04-30 10:30:17,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-04-30 10:30:17,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,597 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:17,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:30:17,597 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:17,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -192608042, now seen corresponding path program 1 times [2025-04-30 10:30:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821189588] [2025-04-30 10:30:17,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:17,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:17,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:17,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:17,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821189588] [2025-04-30 10:30:17,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821189588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:17,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:17,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808205477] [2025-04-30 10:30:17,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:17,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:17,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:17,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:17,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:17,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2025-04-30 10:30:17,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 79.625) internal successors, (637), 8 states have internal predecessors, (637), 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-04-30 10:30:17,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:17,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2025-04-30 10:30:17,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:17,886 INFO L116 PetriNetUnfolderBase]: 71/430 cut-off events. [2025-04-30 10:30:17,886 INFO L117 PetriNetUnfolderBase]: For 102/106 co-relation queries the response was YES. [2025-04-30 10:30:17,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 430 events. 71/430 cut-off events. For 102/106 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2237 event pairs, 1 based on Foata normal form. 14/433 useless extension candidates. Maximal degree in co-relation 701. Up to 32 conditions per place. [2025-04-30 10:30:17,889 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 25 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-04-30 10:30:17,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 328 flow [2025-04-30 10:30:17,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2025-04-30 10:30:17,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8568421052631578 [2025-04-30 10:30:17,892 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 318 flow. Second operand 10 states and 814 transitions. [2025-04-30 10:30:17,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 328 flow [2025-04-30 10:30:17,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:30:17,894 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 228 flow [2025-04-30 10:30:17,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-04-30 10:30:17,895 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -7 predicate places. [2025-04-30 10:30:17,895 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 228 flow [2025-04-30 10:30:17,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.625) internal successors, (637), 8 states have internal predecessors, (637), 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-04-30 10:30:17,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,896 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:17,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:30:17,896 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-30 10:30:17,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1577644839, now seen corresponding path program 1 times [2025-04-30 10:30:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906336227] [2025-04-30 10:30:17,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:17,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:17,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:17,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:17,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:17,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:17,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:17,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:17,938 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-30 10:30:17,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:30:17,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-30 10:30:17,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-30 10:30:17,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:30:17,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:30:17,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:30:17,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:30:17,938 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:17,939 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:17,939 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:30:17,955 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-30 10:30:17,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 113 transitions, 253 flow [2025-04-30 10:30:17,976 INFO L116 PetriNetUnfolderBase]: 8/333 cut-off events. [2025-04-30 10:30:17,977 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-30 10:30:17,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 333 events. 8/333 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 957 event pairs, 1 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 204. Up to 12 conditions per place. [2025-04-30 10:30:17,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 113 transitions, 253 flow [2025-04-30 10:30:17,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 113 transitions, 253 flow [2025-04-30 10:30:17,979 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:17,979 INFO L340 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;@208d5e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:17,979 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-30 10:30:17,980 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:17,980 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:17,980 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:17,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:17,980 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] [2025-04-30 10:30:17,980 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:17,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1826569051, now seen corresponding path program 1 times [2025-04-30 10:30:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:17,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980791949] [2025-04-30 10:30:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:17,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:17,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:17,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:17,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:18,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:18,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980791949] [2025-04-30 10:30:18,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980791949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:18,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:18,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999632382] [2025-04-30 10:30:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:18,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:18,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:18,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:18,040 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 113 [2025-04-30 10:30:18,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 113 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-04-30 10:30:18,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:18,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 113 [2025-04-30 10:30:18,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:18,220 INFO L116 PetriNetUnfolderBase]: 413/2217 cut-off events. [2025-04-30 10:30:18,220 INFO L117 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-04-30 10:30:18,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 2217 events. 413/2217 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17779 event pairs, 232 based on Foata normal form. 1/2031 useless extension candidates. Maximal degree in co-relation 1335. Up to 496 conditions per place. [2025-04-30 10:30:18,232 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 24 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-04-30 10:30:18,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 327 flow [2025-04-30 10:30:18,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2025-04-30 10:30:18,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8960176991150443 [2025-04-30 10:30:18,233 INFO L175 Difference]: Start difference. First operand has 117 places, 113 transitions, 253 flow. Second operand 4 states and 405 transitions. [2025-04-30 10:30:18,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 327 flow [2025-04-30 10:30:18,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:18,235 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 269 flow [2025-04-30 10:30:18,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2025-04-30 10:30:18,236 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 4 predicate places. [2025-04-30 10:30:18,236 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 269 flow [2025-04-30 10:30:18,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-04-30 10:30:18,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:18,236 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] [2025-04-30 10:30:18,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:30:18,236 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:18,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1914753569, now seen corresponding path program 1 times [2025-04-30 10:30:18,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:18,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065939191] [2025-04-30 10:30:18,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:18,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:18,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:18,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:18,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065939191] [2025-04-30 10:30:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065939191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:18,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887912119] [2025-04-30 10:30:18,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:18,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:18,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:18,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:18,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:18,453 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2025-04-30 10:30:18,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 114 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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-04-30 10:30:18,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:18,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2025-04-30 10:30:18,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:18,837 INFO L116 PetriNetUnfolderBase]: 1295/3992 cut-off events. [2025-04-30 10:30:18,837 INFO L117 PetriNetUnfolderBase]: For 327/327 co-relation queries the response was YES. [2025-04-30 10:30:18,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 3992 events. 1295/3992 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 35294 event pairs, 181 based on Foata normal form. 0/3711 useless extension candidates. Maximal degree in co-relation 5668. Up to 1483 conditions per place. [2025-04-30 10:30:18,859 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 50 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-04-30 10:30:18,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 425 flow [2025-04-30 10:30:18,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-04-30 10:30:18,861 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8067846607669616 [2025-04-30 10:30:18,861 INFO L175 Difference]: Start difference. First operand has 121 places, 114 transitions, 269 flow. Second operand 6 states and 547 transitions. [2025-04-30 10:30:18,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 425 flow [2025-04-30 10:30:18,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 137 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:18,864 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 271 flow [2025-04-30 10:30:18,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2025-04-30 10:30:18,865 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-04-30 10:30:18,865 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 271 flow [2025-04-30 10:30:18,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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-04-30 10:30:18,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:18,866 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] [2025-04-30 10:30:18,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:30:18,866 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:18,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash 739877299, now seen corresponding path program 1 times [2025-04-30 10:30:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:18,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384656862] [2025-04-30 10:30:18,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:18,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:18,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:18,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:18,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:18,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:18,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384656862] [2025-04-30 10:30:18,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384656862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:18,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:18,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231061614] [2025-04-30 10:30:18,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:18,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:18,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:18,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:18,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-04-30 10:30:18,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-04-30 10:30:18,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:18,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-04-30 10:30:18,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:19,225 INFO L116 PetriNetUnfolderBase]: 1006/3964 cut-off events. [2025-04-30 10:30:19,225 INFO L117 PetriNetUnfolderBase]: For 807/971 co-relation queries the response was YES. [2025-04-30 10:30:19,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5877 conditions, 3964 events. 1006/3964 cut-off events. For 807/971 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 37671 event pairs, 683 based on Foata normal form. 6/3512 useless extension candidates. Maximal degree in co-relation 4693. Up to 1312 conditions per place. [2025-04-30 10:30:19,244 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 27 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2025-04-30 10:30:19,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 381 flow [2025-04-30 10:30:19,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2025-04-30 10:30:19,245 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9233038348082596 [2025-04-30 10:30:19,245 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 271 flow. Second operand 3 states and 313 transitions. [2025-04-30 10:30:19,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 126 transitions, 381 flow [2025-04-30 10:30:19,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 126 transitions, 371 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:19,247 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 307 flow [2025-04-30 10:30:19,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2025-04-30 10:30:19,248 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-04-30 10:30:19,248 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 307 flow [2025-04-30 10:30:19,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-04-30 10:30:19,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:19,248 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] [2025-04-30 10:30:19,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:30:19,248 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:19,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash 223997323, now seen corresponding path program 1 times [2025-04-30 10:30:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:19,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342123072] [2025-04-30 10:30:19,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:19,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:19,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:19,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:19,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:19,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:19,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342123072] [2025-04-30 10:30:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342123072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:19,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117392614] [2025-04-30 10:30:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:19,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:19,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:19,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:19,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 113 [2025-04-30 10:30:19,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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-04-30 10:30:19,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:19,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 113 [2025-04-30 10:30:19,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:19,594 INFO L116 PetriNetUnfolderBase]: 616/3187 cut-off events. [2025-04-30 10:30:19,594 INFO L117 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2025-04-30 10:30:19,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 3187 events. 616/3187 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29079 event pairs, 252 based on Foata normal form. 63/2922 useless extension candidates. Maximal degree in co-relation 3838. Up to 511 conditions per place. [2025-04-30 10:30:19,611 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 31 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-04-30 10:30:19,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 418 flow [2025-04-30 10:30:19,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2025-04-30 10:30:19,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.911504424778761 [2025-04-30 10:30:19,613 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 307 flow. Second operand 4 states and 412 transitions. [2025-04-30 10:30:19,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 418 flow [2025-04-30 10:30:19,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 134 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:19,616 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 311 flow [2025-04-30 10:30:19,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2025-04-30 10:30:19,617 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2025-04-30 10:30:19,617 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 311 flow [2025-04-30 10:30:19,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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-04-30 10:30:19,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:19,617 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] [2025-04-30 10:30:19,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:30:19,618 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:19,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:19,618 INFO L85 PathProgramCache]: Analyzing trace with hash 570547648, now seen corresponding path program 1 times [2025-04-30 10:30:19,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:19,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416301329] [2025-04-30 10:30:19,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:19,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:19,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:19,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:30:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:19,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416301329] [2025-04-30 10:30:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416301329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:19,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702841429] [2025-04-30 10:30:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:19,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:19,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:19,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:19,743 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2025-04-30 10:30:19,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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-04-30 10:30:19,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:19,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2025-04-30 10:30:19,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:20,171 INFO L116 PetriNetUnfolderBase]: 950/4903 cut-off events. [2025-04-30 10:30:20,171 INFO L117 PetriNetUnfolderBase]: For 649/649 co-relation queries the response was YES. [2025-04-30 10:30:20,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7128 conditions, 4903 events. 950/4903 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 49321 event pairs, 310 based on Foata normal form. 3/4329 useless extension candidates. Maximal degree in co-relation 3734. Up to 1100 conditions per place. [2025-04-30 10:30:20,193 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 35 selfloop transitions, 7 changer transitions 0/139 dead transitions. [2025-04-30 10:30:20,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 437 flow [2025-04-30 10:30:20,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 687 transitions. [2025-04-30 10:30:20,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8685208596713021 [2025-04-30 10:30:20,195 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 311 flow. Second operand 7 states and 687 transitions. [2025-04-30 10:30:20,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 437 flow [2025-04-30 10:30:20,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 139 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:20,201 INFO L231 Difference]: Finished difference. Result has 131 places, 122 transitions, 341 flow [2025-04-30 10:30:20,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=131, PETRI_TRANSITIONS=122} [2025-04-30 10:30:20,201 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2025-04-30 10:30:20,201 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 122 transitions, 341 flow [2025-04-30 10:30:20,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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-04-30 10:30:20,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:20,202 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:20,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:30:20,202 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:20,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 848959388, now seen corresponding path program 1 times [2025-04-30 10:30:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:20,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503924155] [2025-04-30 10:30:20,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:20,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:20,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:20,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:20,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:30:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:20,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503924155] [2025-04-30 10:30:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503924155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:20,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:20,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200719720] [2025-04-30 10:30:20,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:20,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:20,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:20,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:20,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:20,242 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-04-30 10:30:20,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 122 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-04-30 10:30:20,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:20,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-04-30 10:30:20,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:20,533 INFO L116 PetriNetUnfolderBase]: 938/4141 cut-off events. [2025-04-30 10:30:20,534 INFO L117 PetriNetUnfolderBase]: For 1437/1633 co-relation queries the response was YES. [2025-04-30 10:30:20,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 4141 events. 938/4141 cut-off events. For 1437/1633 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 41486 event pairs, 546 based on Foata normal form. 7/3751 useless extension candidates. Maximal degree in co-relation 6583. Up to 1216 conditions per place. [2025-04-30 10:30:20,552 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 28 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2025-04-30 10:30:20,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 466 flow [2025-04-30 10:30:20,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2025-04-30 10:30:20,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9203539823008849 [2025-04-30 10:30:20,553 INFO L175 Difference]: Start difference. First operand has 131 places, 122 transitions, 341 flow. Second operand 3 states and 312 transitions. [2025-04-30 10:30:20,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 466 flow [2025-04-30 10:30:20,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 136 transitions, 456 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:20,556 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 407 flow [2025-04-30 10:30:20,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2025-04-30 10:30:20,557 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2025-04-30 10:30:20,557 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 407 flow [2025-04-30 10:30:20,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-04-30 10:30:20,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:20,557 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:20,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:30:20,557 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:20,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash -835881561, now seen corresponding path program 1 times [2025-04-30 10:30:20,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:20,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464197456] [2025-04-30 10:30:20,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:20,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:20,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:20,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:20,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:20,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:30:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:20,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464197456] [2025-04-30 10:30:20,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464197456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:20,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397693165] [2025-04-30 10:30:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:20,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:20,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:20,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:20,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2025-04-30 10:30:20,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 407 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 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-04-30 10:30:20,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:20,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2025-04-30 10:30:20,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:21,221 INFO L116 PetriNetUnfolderBase]: 1210/6294 cut-off events. [2025-04-30 10:30:21,221 INFO L117 PetriNetUnfolderBase]: For 1575/2583 co-relation queries the response was YES. [2025-04-30 10:30:21,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9952 conditions, 6294 events. 1210/6294 cut-off events. For 1575/2583 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 66842 event pairs, 186 based on Foata normal form. 16/5595 useless extension candidates. Maximal degree in co-relation 5342. Up to 927 conditions per place. [2025-04-30 10:30:21,284 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 47 selfloop transitions, 10 changer transitions 0/161 dead transitions. [2025-04-30 10:30:21,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 161 transitions, 589 flow [2025-04-30 10:30:21,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2025-04-30 10:30:21,287 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8654867256637168 [2025-04-30 10:30:21,287 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 407 flow. Second operand 10 states and 978 transitions. [2025-04-30 10:30:21,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 161 transitions, 589 flow [2025-04-30 10:30:21,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 161 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:21,291 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 429 flow [2025-04-30 10:30:21,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=429, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-04-30 10:30:21,292 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places. [2025-04-30 10:30:21,292 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 429 flow [2025-04-30 10:30:21,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 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-04-30 10:30:21,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:21,292 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:21,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:30:21,292 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:21,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1292015184, now seen corresponding path program 1 times [2025-04-30 10:30:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:21,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973165086] [2025-04-30 10:30:21,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:21,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:21,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:21,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:21,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:30:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:21,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973165086] [2025-04-30 10:30:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973165086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:21,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:30:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62277307] [2025-04-30 10:30:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:21,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:21,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:21,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:21,352 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2025-04-30 10:30:21,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-04-30 10:30:21,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:21,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2025-04-30 10:30:21,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:21,468 INFO L116 PetriNetUnfolderBase]: 98/1375 cut-off events. [2025-04-30 10:30:21,468 INFO L117 PetriNetUnfolderBase]: For 316/360 co-relation queries the response was YES. [2025-04-30 10:30:21,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1375 events. 98/1375 cut-off events. For 316/360 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10218 event pairs, 26 based on Foata normal form. 20/1279 useless extension candidates. Maximal degree in co-relation 919. Up to 101 conditions per place. [2025-04-30 10:30:21,474 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 12 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2025-04-30 10:30:21,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 130 transitions, 460 flow [2025-04-30 10:30:21,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2025-04-30 10:30:21,475 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9469026548672567 [2025-04-30 10:30:21,475 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 429 flow. Second operand 3 states and 321 transitions. [2025-04-30 10:30:21,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 130 transitions, 460 flow [2025-04-30 10:30:21,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 130 transitions, 434 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:21,478 INFO L231 Difference]: Finished difference. Result has 138 places, 125 transitions, 379 flow [2025-04-30 10:30:21,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=138, PETRI_TRANSITIONS=125} [2025-04-30 10:30:21,478 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 21 predicate places. [2025-04-30 10:30:21,479 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 125 transitions, 379 flow [2025-04-30 10:30:21,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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-04-30 10:30:21,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:21,479 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-30 10:30:21,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:30:21,479 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:21,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash -332942382, now seen corresponding path program 1 times [2025-04-30 10:30:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:21,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744163617] [2025-04-30 10:30:21,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:21,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:30:21,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:30:21,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:21,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:21,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744163617] [2025-04-30 10:30:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744163617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843587642] [2025-04-30 10:30:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:21,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:21,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:21,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:21,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:21,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-04-30 10:30:21,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 125 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-04-30 10:30:21,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:21,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-04-30 10:30:21,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:21,649 INFO L116 PetriNetUnfolderBase]: 177/1427 cut-off events. [2025-04-30 10:30:21,649 INFO L117 PetriNetUnfolderBase]: For 749/797 co-relation queries the response was YES. [2025-04-30 10:30:21,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 1427 events. 177/1427 cut-off events. For 749/797 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11053 event pairs, 135 based on Foata normal form. 3/1315 useless extension candidates. Maximal degree in co-relation 2146. Up to 336 conditions per place. [2025-04-30 10:30:21,655 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 23 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-04-30 10:30:21,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 130 transitions, 453 flow [2025-04-30 10:30:21,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2025-04-30 10:30:21,656 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8997050147492626 [2025-04-30 10:30:21,656 INFO L175 Difference]: Start difference. First operand has 138 places, 125 transitions, 379 flow. Second operand 3 states and 305 transitions. [2025-04-30 10:30:21,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 130 transitions, 453 flow [2025-04-30 10:30:21,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 130 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:30:21,659 INFO L231 Difference]: Finished difference. Result has 141 places, 128 transitions, 407 flow [2025-04-30 10:30:21,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=141, PETRI_TRANSITIONS=128} [2025-04-30 10:30:21,659 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 24 predicate places. [2025-04-30 10:30:21,660 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 128 transitions, 407 flow [2025-04-30 10:30:21,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-04-30 10:30:21,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:21,660 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:21,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:30:21,660 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:21,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:21,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1510975137, now seen corresponding path program 1 times [2025-04-30 10:30:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:21,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867431200] [2025-04-30 10:30:21,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:21,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-30 10:30:21,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:30:21,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:21,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:21,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867431200] [2025-04-30 10:30:21,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867431200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:21,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:21,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:21,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100811414] [2025-04-30 10:30:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:21,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:30:21,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:21,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:30:21,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:30:21,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2025-04-30 10:30:21,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 128 transitions, 407 flow. Second operand has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-04-30 10:30:21,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:21,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2025-04-30 10:30:21,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:22,077 INFO L116 PetriNetUnfolderBase]: 151/816 cut-off events. [2025-04-30 10:30:22,078 INFO L117 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-04-30 10:30:22,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 816 events. 151/816 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4776 event pairs, 0 based on Foata normal form. 20/817 useless extension candidates. Maximal degree in co-relation 1481. Up to 88 conditions per place. [2025-04-30 10:30:22,081 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-04-30 10:30:22,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 498 flow [2025-04-30 10:30:22,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:30:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:30:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1245 transitions. [2025-04-30 10:30:22,083 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8475153165418652 [2025-04-30 10:30:22,083 INFO L175 Difference]: Start difference. First operand has 141 places, 128 transitions, 407 flow. Second operand 13 states and 1245 transitions. [2025-04-30 10:30:22,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 498 flow [2025-04-30 10:30:22,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 460 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-04-30 10:30:22,086 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 246 flow [2025-04-30 10:30:22,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2025-04-30 10:30:22,086 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -5 predicate places. [2025-04-30 10:30:22,086 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 246 flow [2025-04-30 10:30:22,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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-04-30 10:30:22,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:22,087 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:22,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:30:22,087 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-30 10:30:22,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash -306173713, now seen corresponding path program 1 times [2025-04-30 10:30:22,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:22,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360916578] [2025-04-30 10:30:22,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:22,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:22,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:30:22,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:30:22,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:22,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:22,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:22,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-30 10:30:22,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:30:22,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:22,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:22,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:22,127 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:22,127 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-30 10:30:22,127 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-30 10:30:22,128 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-30 10:30:22,128 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-30 10:30:22,128 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-30 10:30:22,128 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-30 10:30:22,128 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-30 10:30:22,128 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-30 10:30:22,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:30:22,128 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:22,128 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:30:22,129 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-30 10:30:22,141 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-30 10:30:22,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 131 transitions, 302 flow [2025-04-30 10:30:22,168 INFO L116 PetriNetUnfolderBase]: 21/574 cut-off events. [2025-04-30 10:30:22,168 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-30 10:30:22,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 574 events. 21/574 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2161 event pairs, 6 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 353. Up to 32 conditions per place. [2025-04-30 10:30:22,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 131 transitions, 302 flow [2025-04-30 10:30:22,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 131 transitions, 302 flow [2025-04-30 10:30:22,171 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:30:22,171 INFO L340 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;@208d5e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:30:22,171 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:30:22,172 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:30:22,172 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-30 10:30:22,172 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:30:22,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:22,173 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] [2025-04-30 10:30:22,173 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:22,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:22,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1401892667, now seen corresponding path program 1 times [2025-04-30 10:30:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:22,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433427601] [2025-04-30 10:30:22,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:22,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:30:22,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:30:22,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:22,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:22,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433427601] [2025-04-30 10:30:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433427601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927978602] [2025-04-30 10:30:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:22,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:22,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:22,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:22,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-04-30 10:30:22,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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-04-30 10:30:22,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:22,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-04-30 10:30:22,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:22,815 INFO L116 PetriNetUnfolderBase]: 2017/8327 cut-off events. [2025-04-30 10:30:22,816 INFO L117 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-04-30 10:30:22,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11728 conditions, 8327 events. 2017/8327 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 85606 event pairs, 1191 based on Foata normal form. 1/7616 useless extension candidates. Maximal degree in co-relation 5299. Up to 2119 conditions per place. [2025-04-30 10:30:22,847 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-04-30 10:30:22,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 142 transitions, 392 flow [2025-04-30 10:30:22,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2025-04-30 10:30:22,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8912213740458015 [2025-04-30 10:30:22,849 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 302 flow. Second operand 4 states and 467 transitions. [2025-04-30 10:30:22,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 142 transitions, 392 flow [2025-04-30 10:30:22,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:30:22,851 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 318 flow [2025-04-30 10:30:22,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2025-04-30 10:30:22,851 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 4 predicate places. [2025-04-30 10:30:22,851 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 318 flow [2025-04-30 10:30:22,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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-04-30 10:30:22,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:22,852 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] [2025-04-30 10:30:22,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:30:22,852 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:22,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash 940845538, now seen corresponding path program 1 times [2025-04-30 10:30:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:22,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947504518] [2025-04-30 10:30:22,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:22,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:22,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:30:22,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:30:22,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:22,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:22,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947504518] [2025-04-30 10:30:22,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947504518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:22,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:22,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4089217] [2025-04-30 10:30:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:22,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:22,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:22,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:22,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:23,031 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 131 [2025-04-30 10:30:23,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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-04-30 10:30:23,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:23,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 131 [2025-04-30 10:30:23,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:24,301 INFO L116 PetriNetUnfolderBase]: 6248/15894 cut-off events. [2025-04-30 10:30:24,301 INFO L117 PetriNetUnfolderBase]: For 1589/1589 co-relation queries the response was YES. [2025-04-30 10:30:24,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25970 conditions, 15894 events. 6248/15894 cut-off events. For 1589/1589 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 162501 event pairs, 808 based on Foata normal form. 0/14856 useless extension candidates. Maximal degree in co-relation 9040. Up to 6781 conditions per place. [2025-04-30 10:30:24,401 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 62 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-04-30 10:30:24,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 163 transitions, 514 flow [2025-04-30 10:30:24,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2025-04-30 10:30:24,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8180661577608143 [2025-04-30 10:30:24,404 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 318 flow. Second operand 6 states and 643 transitions. [2025-04-30 10:30:24,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 163 transitions, 514 flow [2025-04-30 10:30:24,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:24,411 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 320 flow [2025-04-30 10:30:24,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-04-30 10:30:24,412 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2025-04-30 10:30:24,413 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 320 flow [2025-04-30 10:30:24,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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-04-30 10:30:24,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:24,413 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] [2025-04-30 10:30:24,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:30:24,413 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:24,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1657327178, now seen corresponding path program 1 times [2025-04-30 10:30:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:24,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399411482] [2025-04-30 10:30:24,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:24,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:30:24,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:30:24,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:24,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:24,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399411482] [2025-04-30 10:30:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399411482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:24,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:24,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791847107] [2025-04-30 10:30:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:24,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:24,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:24,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:24,456 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:24,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-04-30 10:30:24,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:24,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:24,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:26,483 INFO L116 PetriNetUnfolderBase]: 7178/23603 cut-off events. [2025-04-30 10:30:26,483 INFO L117 PetriNetUnfolderBase]: For 4962/6204 co-relation queries the response was YES. [2025-04-30 10:30:26,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35693 conditions, 23603 events. 7178/23603 cut-off events. For 4962/6204 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 286837 event pairs, 4486 based on Foata normal form. 11/20852 useless extension candidates. Maximal degree in co-relation 12989. Up to 8464 conditions per place. [2025-04-30 10:30:26,611 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 36 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2025-04-30 10:30:26,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 149 transitions, 472 flow [2025-04-30 10:30:26,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-04-30 10:30:26,615 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9211195928753181 [2025-04-30 10:30:26,615 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 320 flow. Second operand 3 states and 362 transitions. [2025-04-30 10:30:26,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 149 transitions, 472 flow [2025-04-30 10:30:26,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 149 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:30:26,618 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 364 flow [2025-04-30 10:30:26,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-04-30 10:30:26,619 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2025-04-30 10:30:26,619 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 364 flow [2025-04-30 10:30:26,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-04-30 10:30:26,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:26,619 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] [2025-04-30 10:30:26,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:30:26,619 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:26,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1196376866, now seen corresponding path program 1 times [2025-04-30 10:30:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:26,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172242656] [2025-04-30 10:30:26,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:26,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:30:26,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:30:26,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:26,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:26,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:26,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172242656] [2025-04-30 10:30:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172242656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:30:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352455329] [2025-04-30 10:30:26,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:26,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:30:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:26,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:30:26,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:30:26,683 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-04-30 10:30:26,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:26,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:26,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-04-30 10:30:26,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:28,330 INFO L116 PetriNetUnfolderBase]: 5437/19811 cut-off events. [2025-04-30 10:30:28,331 INFO L117 PetriNetUnfolderBase]: For 2732/2798 co-relation queries the response was YES. [2025-04-30 10:30:28,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30233 conditions, 19811 events. 5437/19811 cut-off events. For 2732/2798 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 241661 event pairs, 2945 based on Foata normal form. 259/17673 useless extension candidates. Maximal degree in co-relation 24434. Up to 3835 conditions per place. [2025-04-30 10:30:28,456 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 40 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-04-30 10:30:28,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 506 flow [2025-04-30 10:30:28,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:30:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:30:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2025-04-30 10:30:28,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9103053435114504 [2025-04-30 10:30:28,457 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 364 flow. Second operand 4 states and 477 transitions. [2025-04-30 10:30:28,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 506 flow [2025-04-30 10:30:28,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:28,468 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 366 flow [2025-04-30 10:30:28,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-04-30 10:30:28,468 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 7 predicate places. [2025-04-30 10:30:28,468 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 366 flow [2025-04-30 10:30:28,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:28,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:28,469 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] [2025-04-30 10:30:28,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:30:28,469 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:28,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash 221013424, now seen corresponding path program 1 times [2025-04-30 10:30:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:28,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333822833] [2025-04-30 10:30:28,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:28,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:30:28,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:30:28,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:28,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:28,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:28,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333822833] [2025-04-30 10:30:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333822833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:28,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:28,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18224468] [2025-04-30 10:30:28,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:28,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:28,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:28,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:28,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:28,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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-04-30 10:30:28,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:28,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:28,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:30,742 INFO L116 PetriNetUnfolderBase]: 6308/24158 cut-off events. [2025-04-30 10:30:30,743 INFO L117 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2025-04-30 10:30:30,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36542 conditions, 24158 events. 6308/24158 cut-off events. For 3185/3185 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 309828 event pairs, 2802 based on Foata normal form. 3/20930 useless extension candidates. Maximal degree in co-relation 20572. Up to 5820 conditions per place. [2025-04-30 10:30:30,914 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 41 selfloop transitions, 7 changer transitions 0/160 dead transitions. [2025-04-30 10:30:30,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 160 transitions, 508 flow [2025-04-30 10:30:30,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2025-04-30 10:30:30,915 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2025-04-30 10:30:30,915 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 366 flow. Second operand 7 states and 791 transitions. [2025-04-30 10:30:30,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 160 transitions, 508 flow [2025-04-30 10:30:30,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 160 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:30,923 INFO L231 Difference]: Finished difference. Result has 150 places, 141 transitions, 396 flow [2025-04-30 10:30:30,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2025-04-30 10:30:30,923 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 14 predicate places. [2025-04-30 10:30:30,923 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 396 flow [2025-04-30 10:30:30,923 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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-04-30 10:30:30,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:30,924 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:30,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:30:30,924 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:30,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1427955564, now seen corresponding path program 1 times [2025-04-30 10:30:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:30,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713951293] [2025-04-30 10:30:30,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:30,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:30:30,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:30:30,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:30,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713951293] [2025-04-30 10:30:30,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713951293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:30,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:30,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:30,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380569484] [2025-04-30 10:30:30,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:30,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:30,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:30,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:30,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:30,961 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:30,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-04-30 10:30:30,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:30,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:30,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:33,682 INFO L116 PetriNetUnfolderBase]: 8620/31172 cut-off events. [2025-04-30 10:30:33,683 INFO L117 PetriNetUnfolderBase]: For 10968/13189 co-relation queries the response was YES. [2025-04-30 10:30:33,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52388 conditions, 31172 events. 8620/31172 cut-off events. For 10968/13189 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 411118 event pairs, 4986 based on Foata normal form. 43/27821 useless extension candidates. Maximal degree in co-relation 51105. Up to 9839 conditions per place. [2025-04-30 10:30:33,876 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 38 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2025-04-30 10:30:33,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 161 transitions, 573 flow [2025-04-30 10:30:33,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-04-30 10:30:33,877 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9185750636132316 [2025-04-30 10:30:33,878 INFO L175 Difference]: Start difference. First operand has 150 places, 141 transitions, 396 flow. Second operand 3 states and 361 transitions. [2025-04-30 10:30:33,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 161 transitions, 573 flow [2025-04-30 10:30:33,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 161 transitions, 563 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:33,904 INFO L231 Difference]: Finished difference. Result has 151 places, 150 transitions, 482 flow [2025-04-30 10:30:33,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=151, PETRI_TRANSITIONS=150} [2025-04-30 10:30:33,904 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 15 predicate places. [2025-04-30 10:30:33,904 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 482 flow [2025-04-30 10:30:33,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-04-30 10:30:33,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:33,905 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:33,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-30 10:30:33,905 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:33,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash 299379018, now seen corresponding path program 1 times [2025-04-30 10:30:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:33,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331050100] [2025-04-30 10:30:33,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:33,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:30:33,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:30:33,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:33,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:33,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331050100] [2025-04-30 10:30:33,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331050100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:33,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:33,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:33,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153923016] [2025-04-30 10:30:33,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:33,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:33,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:33,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:33,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:34,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:34,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 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-04-30 10:30:34,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:34,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:34,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:37,698 INFO L116 PetriNetUnfolderBase]: 9234/37130 cut-off events. [2025-04-30 10:30:37,699 INFO L117 PetriNetUnfolderBase]: For 10531/21435 co-relation queries the response was YES. [2025-04-30 10:30:37,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60596 conditions, 37130 events. 9234/37130 cut-off events. For 10531/21435 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 515189 event pairs, 2450 based on Foata normal form. 33/32098 useless extension candidates. Maximal degree in co-relation 28374. Up to 8114 conditions per place. [2025-04-30 10:30:37,964 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 55 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2025-04-30 10:30:37,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 186 transitions, 694 flow [2025-04-30 10:30:37,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1126 transitions. [2025-04-30 10:30:37,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8595419847328244 [2025-04-30 10:30:37,965 INFO L175 Difference]: Start difference. First operand has 151 places, 150 transitions, 482 flow. Second operand 10 states and 1126 transitions. [2025-04-30 10:30:37,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 186 transitions, 694 flow [2025-04-30 10:30:37,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 186 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:37,997 INFO L231 Difference]: Finished difference. Result has 161 places, 153 transitions, 508 flow [2025-04-30 10:30:37,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=508, PETRI_PLACES=161, PETRI_TRANSITIONS=153} [2025-04-30 10:30:37,997 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 25 predicate places. [2025-04-30 10:30:37,997 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 153 transitions, 508 flow [2025-04-30 10:30:37,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 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-04-30 10:30:37,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:37,998 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-30 10:30:37,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-30 10:30:37,998 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:37,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash 311102176, now seen corresponding path program 1 times [2025-04-30 10:30:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:37,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718494423] [2025-04-30 10:30:37,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:38,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-30 10:30:38,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-30 10:30:38,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:38,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:38,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718494423] [2025-04-30 10:30:38,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718494423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:38,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:38,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:30:38,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406266629] [2025-04-30 10:30:38,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:38,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:38,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:38,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:38,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:38,040 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 131 [2025-04-30 10:30:38,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 153 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-04-30 10:30:38,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:38,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 131 [2025-04-30 10:30:38,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:38,545 INFO L116 PetriNetUnfolderBase]: 531/5139 cut-off events. [2025-04-30 10:30:38,545 INFO L117 PetriNetUnfolderBase]: For 1394/1573 co-relation queries the response was YES. [2025-04-30 10:30:38,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7676 conditions, 5139 events. 531/5139 cut-off events. For 1394/1573 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 55689 event pairs, 193 based on Foata normal form. 140/4810 useless extension candidates. Maximal degree in co-relation 3626. Up to 422 conditions per place. [2025-04-30 10:30:38,571 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 16 selfloop transitions, 8 changer transitions 0/151 dead transitions. [2025-04-30 10:30:38,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 151 transitions, 549 flow [2025-04-30 10:30:38,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-04-30 10:30:38,572 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9414758269720102 [2025-04-30 10:30:38,572 INFO L175 Difference]: Start difference. First operand has 161 places, 153 transitions, 508 flow. Second operand 3 states and 370 transitions. [2025-04-30 10:30:38,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 151 transitions, 549 flow [2025-04-30 10:30:38,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 151 transitions, 523 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:38,577 INFO L231 Difference]: Finished difference. Result has 157 places, 144 transitions, 444 flow [2025-04-30 10:30:38,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=157, PETRI_TRANSITIONS=144} [2025-04-30 10:30:38,577 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 21 predicate places. [2025-04-30 10:30:38,577 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 144 transitions, 444 flow [2025-04-30 10:30:38,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-04-30 10:30:38,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:38,578 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-30 10:30:38,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-30 10:30:38,578 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:38,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash 539356037, now seen corresponding path program 1 times [2025-04-30 10:30:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:38,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578969936] [2025-04-30 10:30:38,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:38,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:30:38,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:30:38,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:38,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:38,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578969936] [2025-04-30 10:30:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578969936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:38,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715834582] [2025-04-30 10:30:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:38,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:38,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:38,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:38,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:38,619 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:38,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 144 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-04-30 10:30:38,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:38,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:38,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:39,062 INFO L116 PetriNetUnfolderBase]: 934/6027 cut-off events. [2025-04-30 10:30:39,062 INFO L117 PetriNetUnfolderBase]: For 3674/3776 co-relation queries the response was YES. [2025-04-30 10:30:39,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10594 conditions, 6027 events. 934/6027 cut-off events. For 3674/3776 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 68524 event pairs, 666 based on Foata normal form. 4/5496 useless extension candidates. Maximal degree in co-relation 3854. Up to 1548 conditions per place. [2025-04-30 10:30:39,094 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2025-04-30 10:30:39,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 151 transitions, 548 flow [2025-04-30 10:30:39,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-04-30 10:30:39,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8931297709923665 [2025-04-30 10:30:39,095 INFO L175 Difference]: Start difference. First operand has 157 places, 144 transitions, 444 flow. Second operand 3 states and 351 transitions. [2025-04-30 10:30:39,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 151 transitions, 548 flow [2025-04-30 10:30:39,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:30:39,099 INFO L231 Difference]: Finished difference. Result has 160 places, 147 transitions, 470 flow [2025-04-30 10:30:39,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=160, PETRI_TRANSITIONS=147} [2025-04-30 10:30:39,099 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 24 predicate places. [2025-04-30 10:30:39,099 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 147 transitions, 470 flow [2025-04-30 10:30:39,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-04-30 10:30:39,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:39,100 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:39,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-30 10:30:39,100 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:39,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1211542257, now seen corresponding path program 1 times [2025-04-30 10:30:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:39,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041921433] [2025-04-30 10:30:39,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:39,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-30 10:30:39,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:30:39,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:39,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:39,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041921433] [2025-04-30 10:30:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041921433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:39,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:39,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992421371] [2025-04-30 10:30:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:39,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:30:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:39,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:30:39,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:30:39,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-04-30 10:30:39,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 147 transitions, 470 flow. Second operand has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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-04-30 10:30:39,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:39,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-04-30 10:30:39,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:40,213 INFO L116 PetriNetUnfolderBase]: 1216/8418 cut-off events. [2025-04-30 10:30:40,213 INFO L117 PetriNetUnfolderBase]: For 3392/3658 co-relation queries the response was YES. [2025-04-30 10:30:40,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13831 conditions, 8418 events. 1216/8418 cut-off events. For 3392/3658 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 91367 event pairs, 207 based on Foata normal form. 20/7681 useless extension candidates. Maximal degree in co-relation 5591. Up to 893 conditions per place. [2025-04-30 10:30:40,251 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 76 selfloop transitions, 14 changer transitions 1/205 dead transitions. [2025-04-30 10:30:40,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 205 transitions, 828 flow [2025-04-30 10:30:40,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:30:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:30:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1457 transitions. [2025-04-30 10:30:40,253 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8555490311215502 [2025-04-30 10:30:40,253 INFO L175 Difference]: Start difference. First operand has 160 places, 147 transitions, 470 flow. Second operand 13 states and 1457 transitions. [2025-04-30 10:30:40,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 205 transitions, 828 flow [2025-04-30 10:30:40,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 205 transitions, 816 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:40,259 INFO L231 Difference]: Finished difference. Result has 174 places, 150 transitions, 520 flow [2025-04-30 10:30:40,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=520, PETRI_PLACES=174, PETRI_TRANSITIONS=150} [2025-04-30 10:30:40,260 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 38 predicate places. [2025-04-30 10:30:40,260 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 150 transitions, 520 flow [2025-04-30 10:30:40,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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-04-30 10:30:40,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:40,261 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:40,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-30 10:30:40,261 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:40,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:40,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1399660987, now seen corresponding path program 1 times [2025-04-30 10:30:40,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:40,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497196831] [2025-04-30 10:30:40,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:40,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:40,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-04-30 10:30:40,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:30:40,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:40,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497196831] [2025-04-30 10:30:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497196831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:40,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023636834] [2025-04-30 10:30:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:40,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:40,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:40,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:40,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:40,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 150 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-04-30 10:30:40,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:40,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:40,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:40,891 INFO L116 PetriNetUnfolderBase]: 883/5710 cut-off events. [2025-04-30 10:30:40,892 INFO L117 PetriNetUnfolderBase]: For 4069/4165 co-relation queries the response was YES. [2025-04-30 10:30:40,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 5710 events. 883/5710 cut-off events. For 4069/4165 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62487 event pairs, 677 based on Foata normal form. 4/5205 useless extension candidates. Maximal degree in co-relation 9769. Up to 1476 conditions per place. [2025-04-30 10:30:40,922 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-04-30 10:30:40,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 156 transitions, 615 flow [2025-04-30 10:30:40,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2025-04-30 10:30:40,923 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8905852417302799 [2025-04-30 10:30:40,923 INFO L175 Difference]: Start difference. First operand has 174 places, 150 transitions, 520 flow. Second operand 3 states and 350 transitions. [2025-04-30 10:30:40,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 156 transitions, 615 flow [2025-04-30 10:30:40,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 156 transitions, 585 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-30 10:30:40,932 INFO L231 Difference]: Finished difference. Result has 170 places, 153 transitions, 526 flow [2025-04-30 10:30:40,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=170, PETRI_TRANSITIONS=153} [2025-04-30 10:30:40,932 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 34 predicate places. [2025-04-30 10:30:40,932 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 153 transitions, 526 flow [2025-04-30 10:30:40,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-04-30 10:30:40,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:40,933 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:40,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-30 10:30:40,933 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:40,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash -396449237, now seen corresponding path program 1 times [2025-04-30 10:30:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:40,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683400389] [2025-04-30 10:30:40,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:40,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-30 10:30:40,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-30 10:30:40,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:40,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:41,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683400389] [2025-04-30 10:30:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683400389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:41,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:41,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:30:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138868934] [2025-04-30 10:30:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:41,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:41,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:41,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:41,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:41,271 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 131 [2025-04-30 10:30:41,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 153 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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-04-30 10:30:41,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:41,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 131 [2025-04-30 10:30:41,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:42,543 INFO L116 PetriNetUnfolderBase]: 2726/11410 cut-off events. [2025-04-30 10:30:42,543 INFO L117 PetriNetUnfolderBase]: For 4376/4680 co-relation queries the response was YES. [2025-04-30 10:30:42,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 11410 events. 2726/11410 cut-off events. For 4376/4680 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 124819 event pairs, 1342 based on Foata normal form. 0/10706 useless extension candidates. Maximal degree in co-relation 19455. Up to 2509 conditions per place. [2025-04-30 10:30:42,611 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 59 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2025-04-30 10:30:42,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 184 transitions, 750 flow [2025-04-30 10:30:42,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:30:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:30:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-04-30 10:30:42,612 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8307888040712468 [2025-04-30 10:30:42,612 INFO L175 Difference]: Start difference. First operand has 170 places, 153 transitions, 526 flow. Second operand 6 states and 653 transitions. [2025-04-30 10:30:42,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 184 transitions, 750 flow [2025-04-30 10:30:42,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 184 transitions, 736 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:42,634 INFO L231 Difference]: Finished difference. Result has 172 places, 152 transitions, 522 flow [2025-04-30 10:30:42,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=172, PETRI_TRANSITIONS=152} [2025-04-30 10:30:42,634 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 36 predicate places. [2025-04-30 10:30:42,634 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 152 transitions, 522 flow [2025-04-30 10:30:42,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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-04-30 10:30:42,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:42,635 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:42,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-30 10:30:42,635 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:42,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 693212984, now seen corresponding path program 1 times [2025-04-30 10:30:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:42,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243046301] [2025-04-30 10:30:42,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:42,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-30 10:30:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-30 10:30:42,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:42,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:42,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243046301] [2025-04-30 10:30:42,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243046301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:42,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:42,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:30:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805522822] [2025-04-30 10:30:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:42,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:30:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:42,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:30:42,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:30:42,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-04-30 10:30:42,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 152 transitions, 522 flow. Second operand has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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-04-30 10:30:42,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:42,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-04-30 10:30:42,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:43,744 INFO L116 PetriNetUnfolderBase]: 1190/7818 cut-off events. [2025-04-30 10:30:43,744 INFO L117 PetriNetUnfolderBase]: For 4028/4256 co-relation queries the response was YES. [2025-04-30 10:30:43,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14600 conditions, 7818 events. 1190/7818 cut-off events. For 4028/4256 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 83866 event pairs, 165 based on Foata normal form. 48/7298 useless extension candidates. Maximal degree in co-relation 5054. Up to 557 conditions per place. [2025-04-30 10:30:43,784 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 90 selfloop transitions, 16 changer transitions 8/229 dead transitions. [2025-04-30 10:30:43,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 229 transitions, 978 flow [2025-04-30 10:30:43,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:30:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:30:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1795 transitions. [2025-04-30 10:30:43,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8563931297709924 [2025-04-30 10:30:43,786 INFO L175 Difference]: Start difference. First operand has 172 places, 152 transitions, 522 flow. Second operand 16 states and 1795 transitions. [2025-04-30 10:30:43,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 229 transitions, 978 flow [2025-04-30 10:30:43,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 229 transitions, 958 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-30 10:30:43,796 INFO L231 Difference]: Finished difference. Result has 178 places, 150 transitions, 522 flow [2025-04-30 10:30:43,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=522, PETRI_PLACES=178, PETRI_TRANSITIONS=150} [2025-04-30 10:30:43,796 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 42 predicate places. [2025-04-30 10:30:43,796 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 150 transitions, 522 flow [2025-04-30 10:30:43,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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-04-30 10:30:43,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:43,797 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:30:43,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-30 10:30:43,797 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:43,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1426205106, now seen corresponding path program 1 times [2025-04-30 10:30:43,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:43,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48997446] [2025-04-30 10:30:43,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:43,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:30:43,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:30:43,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:43,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:43,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48997446] [2025-04-30 10:30:43,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48997446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:43,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:30:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957125150] [2025-04-30 10:30:43,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:43,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:30:43,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:43,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:30:43,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:30:43,835 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-04-30 10:30:43,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 150 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:43,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:43,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-04-30 10:30:43,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:44,493 INFO L116 PetriNetUnfolderBase]: 1353/8934 cut-off events. [2025-04-30 10:30:44,493 INFO L117 PetriNetUnfolderBase]: For 5180/5264 co-relation queries the response was YES. [2025-04-30 10:30:44,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16800 conditions, 8934 events. 1353/8934 cut-off events. For 5180/5264 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106508 event pairs, 605 based on Foata normal form. 0/8374 useless extension candidates. Maximal degree in co-relation 16013. Up to 1591 conditions per place. [2025-04-30 10:30:44,530 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 30 selfloop transitions, 9 changer transitions 1/163 dead transitions. [2025-04-30 10:30:44,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 163 transitions, 656 flow [2025-04-30 10:30:44,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-04-30 10:30:44,531 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9185750636132316 [2025-04-30 10:30:44,531 INFO L175 Difference]: Start difference. First operand has 178 places, 150 transitions, 522 flow. Second operand 3 states and 361 transitions. [2025-04-30 10:30:44,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 163 transitions, 656 flow [2025-04-30 10:30:44,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 163 transitions, 588 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-04-30 10:30:44,563 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 530 flow [2025-04-30 10:30:44,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2025-04-30 10:30:44,563 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 25 predicate places. [2025-04-30 10:30:44,563 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 530 flow [2025-04-30 10:30:44,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:30:44,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:44,564 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:30:44,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-30 10:30:44,564 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:44,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1139614465, now seen corresponding path program 1 times [2025-04-30 10:30:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:44,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480217586] [2025-04-30 10:30:44,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:44,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:44,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-30 10:30:44,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-30 10:30:44,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:30:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:44,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480217586] [2025-04-30 10:30:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480217586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:44,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:30:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652886088] [2025-04-30 10:30:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:44,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:30:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:44,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:30:44,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:30:44,685 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-04-30 10:30:44,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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-04-30 10:30:44,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:44,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-04-30 10:30:44,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:45,182 INFO L116 PetriNetUnfolderBase]: 1110/5875 cut-off events. [2025-04-30 10:30:45,182 INFO L117 PetriNetUnfolderBase]: For 3310/3506 co-relation queries the response was YES. [2025-04-30 10:30:45,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10999 conditions, 5875 events. 1110/5875 cut-off events. For 3310/3506 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 59144 event pairs, 310 based on Foata normal form. 80/5835 useless extension candidates. Maximal degree in co-relation 10335. Up to 748 conditions per place. [2025-04-30 10:30:45,205 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 63 selfloop transitions, 7 changer transitions 8/206 dead transitions. [2025-04-30 10:30:45,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 206 transitions, 852 flow [2025-04-30 10:30:45,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:30:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:30:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2025-04-30 10:30:45,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8953107960741549 [2025-04-30 10:30:45,206 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 530 flow. Second operand 7 states and 821 transitions. [2025-04-30 10:30:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 206 transitions, 852 flow [2025-04-30 10:30:45,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 206 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:30:45,212 INFO L231 Difference]: Finished difference. Result has 168 places, 157 transitions, 548 flow [2025-04-30 10:30:45,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=548, PETRI_PLACES=168, PETRI_TRANSITIONS=157} [2025-04-30 10:30:45,213 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 32 predicate places. [2025-04-30 10:30:45,213 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 548 flow [2025-04-30 10:30:45,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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-04-30 10:30:45,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:45,213 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-04-30 10:30:45,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-30 10:30:45,213 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:45,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1800725741, now seen corresponding path program 1 times [2025-04-30 10:30:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:45,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363667031] [2025-04-30 10:30:45,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:45,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-04-30 10:30:45,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-04-30 10:30:45,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:45,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:30:45,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:45,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363667031] [2025-04-30 10:30:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363667031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:45,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:45,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:30:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867851595] [2025-04-30 10:30:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:45,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:30:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:45,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:30:45,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:30:45,413 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-04-30 10:30:45,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 157 transitions, 548 flow. Second operand has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 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-04-30 10:30:45,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:45,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-04-30 10:30:45,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:30:45,951 INFO L116 PetriNetUnfolderBase]: 1050/4123 cut-off events. [2025-04-30 10:30:45,951 INFO L117 PetriNetUnfolderBase]: For 2254/2282 co-relation queries the response was YES. [2025-04-30 10:30:45,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8358 conditions, 4123 events. 1050/4123 cut-off events. For 2254/2282 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 34935 event pairs, 84 based on Foata normal form. 48/4135 useless extension candidates. Maximal degree in co-relation 7690. Up to 518 conditions per place. [2025-04-30 10:30:45,970 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 88 selfloop transitions, 10 changer transitions 17/234 dead transitions. [2025-04-30 10:30:45,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 234 transitions, 1004 flow [2025-04-30 10:30:45,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:30:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:30:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1158 transitions. [2025-04-30 10:30:45,971 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8839694656488549 [2025-04-30 10:30:45,971 INFO L175 Difference]: Start difference. First operand has 168 places, 157 transitions, 548 flow. Second operand 10 states and 1158 transitions. [2025-04-30 10:30:45,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 234 transitions, 1004 flow [2025-04-30 10:30:45,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 234 transitions, 994 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:30:45,979 INFO L231 Difference]: Finished difference. Result has 178 places, 151 transitions, 552 flow [2025-04-30 10:30:45,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=552, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2025-04-30 10:30:45,979 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 42 predicate places. [2025-04-30 10:30:45,979 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 552 flow [2025-04-30 10:30:45,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 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-04-30 10:30:45,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:45,980 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:30:45,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-30 10:30:45,980 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:30:45,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -174019494, now seen corresponding path program 1 times [2025-04-30 10:30:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:45,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695088697] [2025-04-30 10:30:45,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:45,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-30 10:30:46,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-30 10:30:46,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:46,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:30:46,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-30 10:30:46,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-30 10:30:46,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:46,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:30:46,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:30:46,053 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:30:46,053 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-04-30 10:30:46,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-30 10:30:46,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-30 10:30:46,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-30 10:30:46,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-30 10:30:46,053 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-30 10:30:46,054 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-30 10:30:46,054 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-30 10:30:46,054 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-30 10:30:46,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-30 10:30:46,054 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:46,197 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-04-30 10:30:46,197 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:30:46,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:30:46 BasicIcfg [2025-04-30 10:30:46,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:30:46,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:30:46,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:30:46,204 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:30:46,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:30:14" (3/4) ... [2025-04-30 10:30:46,206 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:30:46,343 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-04-30 10:30:46,385 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:30:46,385 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:30:46,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:30:46,386 INFO L158 Benchmark]: Toolchain (without parser) took 32518.45ms. Allocated memory was 142.6MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 112.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-04-30 10:30:46,386 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:30:46,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.05ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 89.9MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:30:46,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.51ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:30:46,387 INFO L158 Benchmark]: Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:30:46,387 INFO L158 Benchmark]: RCFGBuilder took 285.71ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 71.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:30:46,387 INFO L158 Benchmark]: TraceAbstraction took 31645.82ms. Allocated memory was 142.6MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 71.0MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2025-04-30 10:30:46,387 INFO L158 Benchmark]: Witness Printer took 181.39ms. Allocated memory is still 7.2GB. Free memory was 4.1GB in the beginning and 4.0GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-04-30 10:30:46,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.05ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 89.9MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.51ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.61ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.71ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 71.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31645.82ms. Allocated memory was 142.6MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 71.0MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 181.39ms. Allocated memory is still 7.2GB. Free memory was 4.1GB in the beginning and 4.0GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 4 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L687] 1 return ((void *)0); VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L695] 0 int i = 0; VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L687] 2 return ((void *)0); VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] FCALL, JOIN 2 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L687] 3 return ((void *)0); VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L695] COND FALSE 0 !(i < threads_total - 1) VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L698] 0 return data; VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 4 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [698] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 94 locations, 95 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 10 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 111 locations, 113 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 38 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 128 locations, 131 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 777 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 572 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1149 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 68 mSDtfsCounter, 1149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 13/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 145 locations, 149 edges, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.9s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1612 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1270 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2867 IncrementalHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 105 mSDtfsCounter, 2867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=16, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1325 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1130 ConstructedInterpolants, 0 QuantifiedInterpolants, 3022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-30 10:30:46,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)