./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/value-barrier-race.c --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/value-barrier-race.c -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 a90faccfa0bb35070a7d7b516bcbffbd2a1dfbc0a95418851ae168b344cbae10 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:12:42,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:12:42,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:12:42,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:12:42,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:12:42,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:12:42,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:12:42,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:12:42,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:12:42,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:12:42,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:12:42,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:12:42,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:12:42,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:42,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:42,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:42,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:12:42,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:12:42,279 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 -> a90faccfa0bb35070a7d7b516bcbffbd2a1dfbc0a95418851ae168b344cbae10 [2025-04-29 11:12:42,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:12:42,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:12:42,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:12:42,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:12:42,511 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:12:42,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/value-barrier-race.c [2025-04-29 11:12:43,795 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029491558/455e74b3e4924128a9c059174b47fa86/FLAGea8d1c694 [2025-04-29 11:12:44,003 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:12:44,004 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/value-barrier-race.c [2025-04-29 11:12:44,005 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:44,005 WARN L117 ultiparseSymbolTable]: System include stdbool.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:44,005 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:44,010 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029491558/455e74b3e4924128a9c059174b47fa86/FLAGea8d1c694 [2025-04-29 11:12:44,844 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029491558/455e74b3e4924128a9c059174b47fa86 [2025-04-29 11:12:44,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:12:44,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:12:44,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:44,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:12:44,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:12:44,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:44" (1/1) ... [2025-04-29 11:12:44,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a693231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:44, skipping insertion in model container [2025-04-29 11:12:44,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:44" (1/1) ... [2025-04-29 11:12:44,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:12:45,034 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:45,042 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:12:45,071 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:45,085 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:12:45,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45 WrapperNode [2025-04-29 11:12:45,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:45,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:45,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:12:45,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:12:45,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,119 INFO L138 Inliner]: procedures = 11, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2025-04-29 11:12:45,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:45,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:12:45,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:12:45,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:12:45,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:12:45,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:12:45,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:12:45,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:12:45,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (1/1) ... [2025-04-29 11:12:45,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:12:45,181 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-29 11:12:45,188 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-29 11:12:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:12:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:12:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:12:45,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:12:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:12:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:12:45,203 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:12:45,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:12:45,204 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:12:45,266 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:12:45,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:12:45,397 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:12:45,398 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:12:45,406 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:12:45,406 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:12:45,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:45 BoogieIcfgContainer [2025-04-29 11:12:45,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:12:45,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:12:45,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:12:45,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:12:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:12:44" (1/3) ... [2025-04-29 11:12:45,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18189832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:45, skipping insertion in model container [2025-04-29 11:12:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:45" (2/3) ... [2025-04-29 11:12:45,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18189832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:45, skipping insertion in model container [2025-04-29 11:12:45,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:45" (3/3) ... [2025-04-29 11:12:45,413 INFO L128 eAbstractionObserver]: Analyzing ICFG value-barrier-race.c [2025-04-29 11:12:45,425 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:12:45,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG value-barrier-race.c that has 2 procedures, 88 locations, 91 edges, 1 initial locations, 3 loop locations, and 6 error locations. [2025-04-29 11:12:45,426 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:12:45,473 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:12:45,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 92 transitions, 191 flow [2025-04-29 11:12:45,547 INFO L116 PetriNetUnfolderBase]: 4/136 cut-off events. [2025-04-29 11:12:45,548 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:12:45,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 136 events. 4/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 220 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2025-04-29 11:12:45,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 92 transitions, 191 flow [2025-04-29 11:12:45,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 92 transitions, 191 flow [2025-04-29 11:12:45,558 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:45,567 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;@323f4272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:45,567 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:12:45,578 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:45,578 INFO L116 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-04-29 11:12:45,578 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:45,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:45,582 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] [2025-04-29 11:12:45,582 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:45,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:45,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2012245690, now seen corresponding path program 1 times [2025-04-29 11:12:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:45,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379522499] [2025-04-29 11:12:45,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:45,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:45,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:12:45,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:12:45,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:45,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:45,715 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-29 11:12:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:45,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379522499] [2025-04-29 11:12:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379522499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843219647] [2025-04-29 11:12:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:45,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:45,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:45,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:45,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:45,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 92 [2025-04-29 11:12:45,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-29 11:12:45,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:45,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 92 [2025-04-29 11:12:45,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:45,817 INFO L116 PetriNetUnfolderBase]: 7/171 cut-off events. [2025-04-29 11:12:45,817 INFO L117 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-04-29 11:12:45,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 171 events. 7/171 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 433 event pairs, 3 based on Foata normal form. 7/156 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2025-04-29 11:12:45,820 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 9 selfloop transitions, 4 changer transitions 1/93 dead transitions. [2025-04-29 11:12:45,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 219 flow [2025-04-29 11:12:45,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-04-29 11:12:45,833 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9311594202898551 [2025-04-29 11:12:45,835 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 191 flow. Second operand 3 states and 257 transitions. [2025-04-29 11:12:45,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 219 flow [2025-04-29 11:12:45,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 219 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:45,847 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 215 flow [2025-04-29 11:12:45,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-04-29 11:12:45,852 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2025-04-29 11:12:45,852 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 215 flow [2025-04-29 11:12:45,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-29 11:12:45,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:45,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] [2025-04-29 11:12:45,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:12:45,854 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:45,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash 3063033, now seen corresponding path program 1 times [2025-04-29 11:12:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:45,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972105281] [2025-04-29 11:12:45,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:45,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:45,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:12:45,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:12:45,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:45,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:46,261 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-29 11:12:46,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:46,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972105281] [2025-04-29 11:12:46,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972105281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:46,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:46,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:46,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092664203] [2025-04-29 11:12:46,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:46,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:46,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:46,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:46,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2025-04-29 11:12:46,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-29 11:12:46,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:46,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2025-04-29 11:12:46,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:46,406 INFO L116 PetriNetUnfolderBase]: 5/154 cut-off events. [2025-04-29 11:12:46,406 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-29 11:12:46,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 154 events. 5/154 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 356 event pairs, 1 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2025-04-29 11:12:46,407 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 14 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-04-29 11:12:46,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 251 flow [2025-04-29 11:12:46,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2025-04-29 11:12:46,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2025-04-29 11:12:46,409 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 215 flow. Second operand 6 states and 440 transitions. [2025-04-29 11:12:46,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 251 flow [2025-04-29 11:12:46,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:46,411 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 215 flow [2025-04-29 11:12:46,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-04-29 11:12:46,415 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-04-29 11:12:46,415 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 215 flow [2025-04-29 11:12:46,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-29 11:12:46,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:46,415 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] [2025-04-29 11:12:46,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:12:46,415 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:46,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash -90435522, now seen corresponding path program 1 times [2025-04-29 11:12:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:46,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817577916] [2025-04-29 11:12:46,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:46,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:12:46,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:12:46,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:46,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:46,462 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-29 11:12:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:46,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817577916] [2025-04-29 11:12:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817577916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:46,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002836578] [2025-04-29 11:12:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:46,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:46,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:46,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:46,476 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 92 [2025-04-29 11:12:46,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-29 11:12:46,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:46,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 92 [2025-04-29 11:12:46,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:46,517 INFO L116 PetriNetUnfolderBase]: 18/223 cut-off events. [2025-04-29 11:12:46,517 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:12:46,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 223 events. 18/223 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 709 event pairs, 4 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 205. Up to 29 conditions per place. [2025-04-29 11:12:46,521 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 9 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2025-04-29 11:12:46,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 247 flow [2025-04-29 11:12:46,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-04-29 11:12:46,523 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9202898550724637 [2025-04-29 11:12:46,525 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 215 flow. Second operand 3 states and 254 transitions. [2025-04-29 11:12:46,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 247 flow [2025-04-29 11:12:46,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 237 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:46,527 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 235 flow [2025-04-29 11:12:46,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2025-04-29 11:12:46,528 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2025-04-29 11:12:46,528 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 235 flow [2025-04-29 11:12:46,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-29 11:12:46,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:46,529 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] [2025-04-29 11:12:46,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:12:46,529 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:46,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1600497490, now seen corresponding path program 1 times [2025-04-29 11:12:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:46,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052760918] [2025-04-29 11:12:46,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:46,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:12:46,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:12:46,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:46,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:46,570 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-29 11:12:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:46,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052760918] [2025-04-29 11:12:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052760918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:46,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:46,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443106543] [2025-04-29 11:12:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:46,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:46,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:46,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:46,578 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 92 [2025-04-29 11:12:46,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-29 11:12:46,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:46,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 92 [2025-04-29 11:12:46,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:46,611 INFO L116 PetriNetUnfolderBase]: 19/266 cut-off events. [2025-04-29 11:12:46,611 INFO L117 PetriNetUnfolderBase]: For 48/53 co-relation queries the response was YES. [2025-04-29 11:12:46,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 266 events. 19/266 cut-off events. For 48/53 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 959 event pairs, 1 based on Foata normal form. 1/236 useless extension candidates. Maximal degree in co-relation 263. Up to 24 conditions per place. [2025-04-29 11:12:46,614 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 8 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-04-29 11:12:46,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 99 transitions, 282 flow [2025-04-29 11:12:46,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-04-29 11:12:46,615 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9528985507246377 [2025-04-29 11:12:46,615 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 235 flow. Second operand 3 states and 263 transitions. [2025-04-29 11:12:46,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 99 transitions, 282 flow [2025-04-29 11:12:46,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:46,617 INFO L231 Difference]: Finished difference. Result has 97 places, 98 transitions, 267 flow [2025-04-29 11:12:46,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=97, PETRI_TRANSITIONS=98} [2025-04-29 11:12:46,618 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2025-04-29 11:12:46,618 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 98 transitions, 267 flow [2025-04-29 11:12:46,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-29 11:12:46,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:46,618 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] [2025-04-29 11:12:46,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:12:46,618 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:46,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1988529590, now seen corresponding path program 1 times [2025-04-29 11:12:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:46,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235957587] [2025-04-29 11:12:46,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:46,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:12:46,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:12:46,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:46,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:46,654 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-29 11:12:46,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:46,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235957587] [2025-04-29 11:12:46,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235957587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:46,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:46,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904676111] [2025-04-29 11:12:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:46,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:46,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:46,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:46,663 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 92 [2025-04-29 11:12:46,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-29 11:12:46,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:46,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 92 [2025-04-29 11:12:46,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:46,702 INFO L116 PetriNetUnfolderBase]: 19/332 cut-off events. [2025-04-29 11:12:46,702 INFO L117 PetriNetUnfolderBase]: For 72/84 co-relation queries the response was YES. [2025-04-29 11:12:46,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 332 events. 19/332 cut-off events. For 72/84 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1389 event pairs, 0 based on Foata normal form. 3/305 useless extension candidates. Maximal degree in co-relation 338. Up to 26 conditions per place. [2025-04-29 11:12:46,704 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 6 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-04-29 11:12:46,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 298 flow [2025-04-29 11:12:46,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-04-29 11:12:46,705 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9492753623188406 [2025-04-29 11:12:46,705 INFO L175 Difference]: Start difference. First operand has 97 places, 98 transitions, 267 flow. Second operand 3 states and 262 transitions. [2025-04-29 11:12:46,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 298 flow [2025-04-29 11:12:46,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:46,709 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 287 flow [2025-04-29 11:12:46,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2025-04-29 11:12:46,710 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-04-29 11:12:46,710 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 287 flow [2025-04-29 11:12:46,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-29 11:12:46,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:46,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:46,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:12:46,711 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:46,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1175700562, now seen corresponding path program 1 times [2025-04-29 11:12:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:46,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078274233] [2025-04-29 11:12:46,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:46,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:12:46,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:12:46,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:46,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:46,787 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-29 11:12:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:46,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078274233] [2025-04-29 11:12:46,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078274233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:46,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551273100] [2025-04-29 11:12:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:46,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:46,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:46,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:46,875 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 92 [2025-04-29 11:12:46,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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-29 11:12:46,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:46,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 92 [2025-04-29 11:12:46,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:46,937 INFO L116 PetriNetUnfolderBase]: 19/338 cut-off events. [2025-04-29 11:12:46,939 INFO L117 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2025-04-29 11:12:46,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 338 events. 19/338 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1433 event pairs, 0 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2025-04-29 11:12:46,941 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 11 selfloop transitions, 2 changer transitions 5/105 dead transitions. [2025-04-29 11:12:46,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 105 transitions, 333 flow [2025-04-29 11:12:46,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2025-04-29 11:12:46,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8713768115942029 [2025-04-29 11:12:46,943 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 287 flow. Second operand 6 states and 481 transitions. [2025-04-29 11:12:46,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 105 transitions, 333 flow [2025-04-29 11:12:46,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:46,949 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 297 flow [2025-04-29 11:12:46,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2025-04-29 11:12:46,950 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 15 predicate places. [2025-04-29 11:12:46,950 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 297 flow [2025-04-29 11:12:46,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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-29 11:12:46,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:46,950 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] [2025-04-29 11:12:46,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:12:46,951 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:46,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -664931334, now seen corresponding path program 1 times [2025-04-29 11:12:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:46,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451735935] [2025-04-29 11:12:46,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:46,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:12:46,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:12:46,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:46,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:46,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:46,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:12:46,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:12:46,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:46,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:47,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:47,010 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:47,011 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-29 11:12:47,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:12:47,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:12:47,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-29 11:12:47,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-29 11:12:47,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-29 11:12:47,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:12:47,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:12:47,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:12:47,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:12:47,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:47,016 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:12:47,016 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:12:47,031 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:12:47,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 107 transitions, 230 flow [2025-04-29 11:12:47,052 INFO L116 PetriNetUnfolderBase]: 8/226 cut-off events. [2025-04-29 11:12:47,052 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:12:47,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 226 events. 8/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 451 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 138. Up to 6 conditions per place. [2025-04-29 11:12:47,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 107 transitions, 230 flow [2025-04-29 11:12:47,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 107 transitions, 230 flow [2025-04-29 11:12:47,054 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:47,057 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;@323f4272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:47,058 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-29 11:12:47,060 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:47,062 INFO L116 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-04-29 11:12:47,062 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:47,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:47,062 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] [2025-04-29 11:12:47,062 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:47,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1605141638, now seen corresponding path program 1 times [2025-04-29 11:12:47,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:47,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029928801] [2025-04-29 11:12:47,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:47,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:12:47,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:12:47,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:47,094 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-29 11:12:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:47,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029928801] [2025-04-29 11:12:47,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029928801] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:47,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:47,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:47,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708892088] [2025-04-29 11:12:47,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:47,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:47,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:47,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:47,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-04-29 11:12:47,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-29 11:12:47,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:47,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-04-29 11:12:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:47,170 INFO L116 PetriNetUnfolderBase]: 43/436 cut-off events. [2025-04-29 11:12:47,171 INFO L117 PetriNetUnfolderBase]: For 33/40 co-relation queries the response was YES. [2025-04-29 11:12:47,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 436 events. 43/436 cut-off events. For 33/40 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1875 event pairs, 23 based on Foata normal form. 40/411 useless extension candidates. Maximal degree in co-relation 309. Up to 83 conditions per place. [2025-04-29 11:12:47,173 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 12 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2025-04-29 11:12:47,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 266 flow [2025-04-29 11:12:47,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-04-29 11:12:47,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9221183800623053 [2025-04-29 11:12:47,178 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 230 flow. Second operand 3 states and 296 transitions. [2025-04-29 11:12:47,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 108 transitions, 266 flow [2025-04-29 11:12:47,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:47,179 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 260 flow [2025-04-29 11:12:47,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-04-29 11:12:47,180 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2025-04-29 11:12:47,180 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 260 flow [2025-04-29 11:12:47,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-29 11:12:47,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:47,182 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] [2025-04-29 11:12:47,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:12:47,182 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:47,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1683746201, now seen corresponding path program 1 times [2025-04-29 11:12:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:47,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815503919] [2025-04-29 11:12:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:47,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:12:47,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:12:47,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:47,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:47,375 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-29 11:12:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:47,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815503919] [2025-04-29 11:12:47,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815503919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:47,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:47,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:47,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734842563] [2025-04-29 11:12:47,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:47,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:47,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:47,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:47,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:47,460 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2025-04-29 11:12:47,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 260 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-29 11:12:47,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:47,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2025-04-29 11:12:47,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:47,501 INFO L116 PetriNetUnfolderBase]: 28/353 cut-off events. [2025-04-29 11:12:47,501 INFO L117 PetriNetUnfolderBase]: For 40/45 co-relation queries the response was YES. [2025-04-29 11:12:47,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 353 events. 28/353 cut-off events. For 40/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1325 event pairs, 9 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 273. Up to 45 conditions per place. [2025-04-29 11:12:47,502 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 16 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-04-29 11:12:47,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 300 flow [2025-04-29 11:12:47,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2025-04-29 11:12:47,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8006230529595015 [2025-04-29 11:12:47,506 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 260 flow. Second operand 6 states and 514 transitions. [2025-04-29 11:12:47,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 300 flow [2025-04-29 11:12:47,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:47,508 INFO L231 Difference]: Finished difference. Result has 110 places, 106 transitions, 258 flow [2025-04-29 11:12:47,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2025-04-29 11:12:47,508 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2025-04-29 11:12:47,508 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 258 flow [2025-04-29 11:12:47,509 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-29 11:12:47,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:47,509 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] [2025-04-29 11:12:47,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:12:47,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:47,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash 766653342, now seen corresponding path program 1 times [2025-04-29 11:12:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:47,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305219470] [2025-04-29 11:12:47,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:47,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:12:47,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:12:47,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:47,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:47,536 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-29 11:12:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:47,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305219470] [2025-04-29 11:12:47,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305219470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:47,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:47,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:47,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874017234] [2025-04-29 11:12:47,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:47,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:47,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:47,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:47,548 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-04-29 11:12:47,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-29 11:12:47,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:47,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-04-29 11:12:47,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:47,601 INFO L116 PetriNetUnfolderBase]: 119/767 cut-off events. [2025-04-29 11:12:47,602 INFO L117 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2025-04-29 11:12:47,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 767 events. 119/767 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4397 event pairs, 39 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 732. Up to 129 conditions per place. [2025-04-29 11:12:47,619 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-04-29 11:12:47,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 110 transitions, 300 flow [2025-04-29 11:12:47,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2025-04-29 11:12:47,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9065420560747663 [2025-04-29 11:12:47,622 INFO L175 Difference]: Start difference. First operand has 110 places, 106 transitions, 258 flow. Second operand 3 states and 291 transitions. [2025-04-29 11:12:47,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 110 transitions, 300 flow [2025-04-29 11:12:47,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 290 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:47,624 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 286 flow [2025-04-29 11:12:47,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2025-04-29 11:12:47,625 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2025-04-29 11:12:47,625 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 286 flow [2025-04-29 11:12:47,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-29 11:12:47,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:47,625 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] [2025-04-29 11:12:47,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:12:47,626 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:47,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash -743021343, now seen corresponding path program 1 times [2025-04-29 11:12:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:47,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893373733] [2025-04-29 11:12:47,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:47,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:12:47,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:12:47,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:47,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:47,651 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-29 11:12:47,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:47,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893373733] [2025-04-29 11:12:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893373733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:47,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:47,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:47,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739341035] [2025-04-29 11:12:47,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:47,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:47,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:47,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:47,662 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2025-04-29 11:12:47,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-29 11:12:47,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:47,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2025-04-29 11:12:47,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:47,715 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][102], [5#L44-4true, 40#L24-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 93#L24-1true, 126#(= |#race~ready~0| 0), 119#true]) [2025-04-29 11:12:47,716 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,716 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,716 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,716 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,722 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][113], [5#L44-4true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 59#L24-1true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 82#L24-2true, 126#(= |#race~ready~0| 0), 119#true]) [2025-04-29 11:12:47,723 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,723 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,723 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,723 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,726 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [40#L24-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 26#L47true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 93#L24-1true, 126#(= |#race~ready~0| 0), 119#true]) [2025-04-29 11:12:47,726 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:47,726 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,726 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,726 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:47,730 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][90], [Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 26#L47true, 59#L24-1true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 82#L24-2true, 126#(= |#race~ready~0| 0), 119#true]) [2025-04-29 11:12:47,731 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:47,731 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:47,731 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,731 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,764 INFO L116 PetriNetUnfolderBase]: 235/1380 cut-off events. [2025-04-29 11:12:47,764 INFO L117 PetriNetUnfolderBase]: For 400/483 co-relation queries the response was YES. [2025-04-29 11:12:47,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 1380 events. 235/1380 cut-off events. For 400/483 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10191 event pairs, 33 based on Foata normal form. 6/1151 useless extension candidates. Maximal degree in co-relation 1628. Up to 253 conditions per place. [2025-04-29 11:12:47,771 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 16 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2025-04-29 11:12:47,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 120 transitions, 379 flow [2025-04-29 11:12:47,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-04-29 11:12:47,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2025-04-29 11:12:47,772 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 286 flow. Second operand 3 states and 300 transitions. [2025-04-29 11:12:47,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 120 transitions, 379 flow [2025-04-29 11:12:47,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 120 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:47,775 INFO L231 Difference]: Finished difference. Result has 111 places, 117 transitions, 346 flow [2025-04-29 11:12:47,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=111, PETRI_TRANSITIONS=117} [2025-04-29 11:12:47,777 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2025-04-29 11:12:47,777 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 117 transitions, 346 flow [2025-04-29 11:12:47,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-29 11:12:47,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:47,777 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] [2025-04-29 11:12:47,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:12:47,777 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:47,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 912962626, now seen corresponding path program 1 times [2025-04-29 11:12:47,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:47,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680810461] [2025-04-29 11:12:47,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:47,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:47,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:12:47,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:12:47,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:47,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:47,801 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-29 11:12:47,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:47,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680810461] [2025-04-29 11:12:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680810461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:47,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:47,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:47,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833263340] [2025-04-29 11:12:47,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:47,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:47,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:47,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:47,812 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2025-04-29 11:12:47,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 117 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-29 11:12:47,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:47,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2025-04-29 11:12:47,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:47,896 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][119], [5#L44-4true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 59#L24-1true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 129#true, Black: 124#true, 82#L24-2true, 126#(= |#race~ready~0| 0)]) [2025-04-29 11:12:47,896 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,896 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,896 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,896 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,898 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][103], [5#L44-4true, 40#L24-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 93#L24-1true, 129#true, Black: 124#true, 126#(= |#race~ready~0| 0)]) [2025-04-29 11:12:47,899 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,899 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,899 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:47,899 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:47,906 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [40#L24-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 26#L47true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 129#true, 93#L24-1true, Black: 124#true, 126#(= |#race~ready~0| 0)]) [2025-04-29 11:12:47,906 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:47,906 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:47,907 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,907 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,917 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][89], [Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 26#L47true, 59#L24-1true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 129#true, 82#L24-2true, Black: 124#true, 126#(= |#race~ready~0| 0)]) [2025-04-29 11:12:47,918 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:47,918 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,918 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:47,918 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,034 INFO L116 PetriNetUnfolderBase]: 382/2576 cut-off events. [2025-04-29 11:12:48,035 INFO L117 PetriNetUnfolderBase]: For 787/1076 co-relation queries the response was YES. [2025-04-29 11:12:48,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4116 conditions, 2576 events. 382/2576 cut-off events. For 787/1076 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 23522 event pairs, 43 based on Foata normal form. 25/2276 useless extension candidates. Maximal degree in co-relation 2474. Up to 353 conditions per place. [2025-04-29 11:12:48,052 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 16 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2025-04-29 11:12:48,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 127 transitions, 433 flow [2025-04-29 11:12:48,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-04-29 11:12:48,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2025-04-29 11:12:48,054 INFO L175 Difference]: Start difference. First operand has 111 places, 117 transitions, 346 flow. Second operand 3 states and 300 transitions. [2025-04-29 11:12:48,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 127 transitions, 433 flow [2025-04-29 11:12:48,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:48,058 INFO L231 Difference]: Finished difference. Result has 113 places, 124 transitions, 402 flow [2025-04-29 11:12:48,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=113, PETRI_TRANSITIONS=124} [2025-04-29 11:12:48,058 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2025-04-29 11:12:48,060 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 124 transitions, 402 flow [2025-04-29 11:12:48,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-29 11:12:48,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:48,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:48,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:12:48,060 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:48,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2110296263, now seen corresponding path program 1 times [2025-04-29 11:12:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:48,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468451284] [2025-04-29 11:12:48,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:48,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:12:48,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:12:48,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:48,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:48,114 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-29 11:12:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:48,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468451284] [2025-04-29 11:12:48,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468451284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:48,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948424534] [2025-04-29 11:12:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:48,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:12:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:48,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:12:48,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:12:48,170 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2025-04-29 11:12:48,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 124 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-29 11:12:48,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:48,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2025-04-29 11:12:48,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:48,238 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][100], [5#L44-4true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 40#L24-2true, 106#true, Black: 131#(= |#race~data~0| 0), Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 134#true, 129#true, 93#L24-1true, Black: 124#true]) [2025-04-29 11:12:48,238 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,238 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,238 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,238 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,239 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][123], [5#L44-4true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, Black: 131#(= |#race~data~0| 0), 59#L24-1true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 134#true, 129#true, 82#L24-2true, Black: 124#true]) [2025-04-29 11:12:48,239 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,239 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,239 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,239 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,245 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][56], [40#L24-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 26#L47true, Black: 131#(= |#race~data~0| 0), 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 134#true, 129#true, 93#L24-1true, Black: 124#true]) [2025-04-29 11:12:48,245 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,246 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,246 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,246 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,254 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][77], [Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 106#true, 26#L47true, Black: 131#(= |#race~data~0| 0), 59#L24-1true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 134#true, 129#true, 82#L24-2true, Black: 124#true]) [2025-04-29 11:12:48,255 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,255 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,255 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,255 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,356 INFO L116 PetriNetUnfolderBase]: 363/2559 cut-off events. [2025-04-29 11:12:48,356 INFO L117 PetriNetUnfolderBase]: For 783/1033 co-relation queries the response was YES. [2025-04-29 11:12:48,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 2559 events. 363/2559 cut-off events. For 783/1033 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 23575 event pairs, 33 based on Foata normal form. 1/2310 useless extension candidates. Maximal degree in co-relation 3398. Up to 329 conditions per place. [2025-04-29 11:12:48,365 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 14 selfloop transitions, 2 changer transitions 5/130 dead transitions. [2025-04-29 11:12:48,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 456 flow [2025-04-29 11:12:48,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-04-29 11:12:48,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8660436137071651 [2025-04-29 11:12:48,367 INFO L175 Difference]: Start difference. First operand has 113 places, 124 transitions, 402 flow. Second operand 6 states and 556 transitions. [2025-04-29 11:12:48,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 456 flow [2025-04-29 11:12:48,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:48,369 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 410 flow [2025-04-29 11:12:48,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2025-04-29 11:12:48,370 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 15 predicate places. [2025-04-29 11:12:48,370 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 410 flow [2025-04-29 11:12:48,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-29 11:12:48,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:48,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:48,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:12:48,370 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:48,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1254592639, now seen corresponding path program 1 times [2025-04-29 11:12:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:48,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224577515] [2025-04-29 11:12:48,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:48,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:12:48,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:12:48,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:48,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:48,444 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-29 11:12:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:48,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224577515] [2025-04-29 11:12:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224577515] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:12:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67118554] [2025-04-29 11:12:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:48,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:48,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:48,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:48,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2025-04-29 11:12:48,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-29 11:12:48,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:48,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2025-04-29 11:12:48,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:48,488 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][78], [Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), Black: 131#(= |#race~data~0| 0), 145#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 134#true, 5#L44-4true, 40#L24-2true, 106#true, Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 93#L24-1true, Black: 124#true, Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2025-04-29 11:12:48,488 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,488 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,488 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,488 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,490 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][101], [Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), Black: 131#(= |#race~data~0| 0), 59#L24-1true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 145#true, 104#true, 134#true, 5#L44-4true, 106#true, Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 124#true, 82#L24-2true, Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2025-04-29 11:12:48,490 INFO L286 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,490 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-29 11:12:48,490 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,490 INFO L289 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-04-29 11:12:48,496 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][40], [Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 26#L47true, Black: 131#(= |#race~data~0| 0), 145#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 134#true, 40#L24-2true, 106#true, Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 93#L24-1true, Black: 124#true, Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2025-04-29 11:12:48,496 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,496 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,496 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,496 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,501 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L24-3-->L24-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet7#1|), 26#L47true, Black: 131#(= |#race~data~0| 0), 59#L24-1true, 145#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet8#1|), 104#true, 134#true, 106#true, Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 124#true, 82#L24-2true, Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2025-04-29 11:12:48,502 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,502 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,502 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-29 11:12:48,502 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-29 11:12:48,560 INFO L116 PetriNetUnfolderBase]: 216/1429 cut-off events. [2025-04-29 11:12:48,560 INFO L117 PetriNetUnfolderBase]: For 339/454 co-relation queries the response was YES. [2025-04-29 11:12:48,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1429 events. 216/1429 cut-off events. For 339/454 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 11133 event pairs, 32 based on Foata normal form. 9/1328 useless extension candidates. Maximal degree in co-relation 2331. Up to 214 conditions per place. [2025-04-29 11:12:48,565 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 6 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-04-29 11:12:48,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 368 flow [2025-04-29 11:12:48,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-04-29 11:12:48,567 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9283489096573209 [2025-04-29 11:12:48,567 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 410 flow. Second operand 3 states and 298 transitions. [2025-04-29 11:12:48,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 368 flow [2025-04-29 11:12:48,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 346 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-04-29 11:12:48,570 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 340 flow [2025-04-29 11:12:48,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-04-29 11:12:48,570 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2025-04-29 11:12:48,570 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 340 flow [2025-04-29 11:12:48,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-29 11:12:48,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:48,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:48,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:12:48,571 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:12:48,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1245742788, now seen corresponding path program 1 times [2025-04-29 11:12:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:48,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642428161] [2025-04-29 11:12:48,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:48,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:12:48,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:12:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:48,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:48,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:48,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:12:48,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:12:48,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:48,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:48,589 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-29 11:12:48,589 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-29 11:12:48,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:12:48,590 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:48,626 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-29 11:12:48,626 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:12:48,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:12:48 BasicIcfg [2025-04-29 11:12:48,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:12:48,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:12:48,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:12:48,630 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:12:48,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:45" (3/4) ... [2025-04-29 11:12:48,631 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:12:48,662 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-04-29 11:12:48,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:12:48,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:12:48,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:12:48,690 INFO L158 Benchmark]: Toolchain (without parser) took 3843.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 115.0MB in the beginning and 106.9MB in the end (delta: 8.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2025-04-29 11:12:48,691 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:48,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.12ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 100.9MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:12:48,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.73ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:48,691 INFO L158 Benchmark]: Boogie Preprocessor took 32.45ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.4MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:48,691 INFO L158 Benchmark]: RCFGBuilder took 252.05ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 84.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:12:48,691 INFO L158 Benchmark]: TraceAbstraction took 3221.49ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 83.7MB in the beginning and 117.6MB in the end (delta: -33.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:48,691 INFO L158 Benchmark]: Witness Printer took 59.88ms. Allocated memory is still 176.2MB. Free memory was 117.6MB in the beginning and 106.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:48,694 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.12ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 100.9MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.73ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.45ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.4MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 252.05ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 84.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3221.49ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 83.7MB in the beginning and 117.6MB in the end (delta: -33.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.88ms. Allocated memory is still 176.2MB. Free memory was 117.6MB in the beginning and 106.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 24]: Data race detected Data race detected The following path leads to a data race: [L19] 0 bool ready = false; VAL [ready=0] [L20] 0 int data = 0; VAL [data=0, ready=0] [L31] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, ready=0, threads_total=1] [L32] CALL 0 assume_abort_if_not(threads_total >= 0) [L15] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, data=0, ready=0] [L32] RET 0 assume_abort_if_not(threads_total >= 0) [L34] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={-2:0}] [L37] 0 int i = 0; VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L37] COND TRUE 0 i < threads_total VAL [data=0, ready=0] [L38] 0 pthread_create(&tids[i], NULL, &thread, NULL) VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L38] FCALL, FORK 0 pthread_create(&tids[i], NULL, &thread, NULL) VAL [\at(arg, Pre)={0:0}, data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L24] 1 !ready VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, ready=0] [L37] 0 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L37] COND FALSE 0 !(i < threads_total) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, ready=0] [L41] 0 data = __VERIFIER_nondet_int() VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={-2:0}] [L44] 0 ready = true VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={-2:0}] [L24] 1 !ready VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, ready=1] Now there is a data race on ~ready~0 between C: ready = true [44] and C: !ready [24] - UnprovableResult [Line: 41]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 38]: 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. - UnprovableResult [Line: 26]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 101 locations, 107 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: 1.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 12 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, 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.5s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 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, 113 locations, 122 edges, 11 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: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 17 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 474 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:12:48,706 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)