./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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 ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:00:15,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:00:15,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:00:15,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:00:15,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:00:15,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:00:15,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:00:15,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:00:15,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:00:15,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:00:15,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:00:15,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:00:15,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:00:15,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:00:15,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:00:15,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:00:15,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:00:15,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:00:15,993 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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-03-13 22:00:16,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:00:16,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:00:16,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:00:16,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:00:16,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:00:16,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-13 22:00:17,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9d801b1/f3f0aed1da2048b2bd25a793ce1f982a/FLAG9edfd8cc4 [2025-03-13 22:00:17,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:00:17,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-03-13 22:00:17,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9d801b1/f3f0aed1da2048b2bd25a793ce1f982a/FLAG9edfd8cc4 [2025-03-13 22:00:17,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9d801b1/f3f0aed1da2048b2bd25a793ce1f982a [2025-03-13 22:00:17,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:00:17,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:00:17,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:00:17,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:00:17,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:00:17,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:00:17" (1/1) ... [2025-03-13 22:00:17,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e7f754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:17, skipping insertion in model container [2025-03-13 22:00:17,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:00:17" (1/1) ... [2025-03-13 22:00:17,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:00:18,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:00:18,177 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:00:18,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:00:18,240 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:00:18,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18 WrapperNode [2025-03-13 22:00:18,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:00:18,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:00:18,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:00:18,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:00:18,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,271 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2025-03-13 22:00:18,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:00:18,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:00:18,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:00:18,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:00:18,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:00:18,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:00:18,297 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:00:18,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:00:18,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (1/1) ... [2025-03-13 22:00:18,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:00:18,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:00:18,329 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-03-13 22:00:18,332 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-03-13 22:00:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-03-13 22:00:18,349 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-03-13 22:00:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 22:00:18,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 22:00:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:00:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:00:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:00:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:00:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:00:18,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:00:18,351 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:00:18,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:00:18,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:00:18,604 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:00:18,605 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:00:18,605 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:00:18,626 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:00:18,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:00:18 BoogieIcfgContainer [2025-03-13 22:00:18,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:00:18,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:00:18,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:00:18,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:00:18,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:00:17" (1/3) ... [2025-03-13 22:00:18,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5030e70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:00:18, skipping insertion in model container [2025-03-13 22:00:18,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:00:18" (2/3) ... [2025-03-13 22:00:18,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5030e70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:00:18, skipping insertion in model container [2025-03-13 22:00:18,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:00:18" (3/3) ... [2025-03-13 22:00:18,634 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-03-13 22:00:18,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:00:18,648 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 100 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-13 22:00:18,649 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:00:18,722 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:00:18,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 104 transitions, 216 flow [2025-03-13 22:00:18,831 INFO L124 PetriNetUnfolderBase]: 4/110 cut-off events. [2025-03-13 22:00:18,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:00:18,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 110 events. 4/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 177 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2025-03-13 22:00:18,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 104 transitions, 216 flow [2025-03-13 22:00:18,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 103 transitions, 213 flow [2025-03-13 22:00:18,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:00:18,866 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ac9ab67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:00:18,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-13 22:00:18,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:00:18,875 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-03-13 22:00:18,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:00:18,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:18,876 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] [2025-03-13 22:00:18,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 22:00:18,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 900621300, now seen corresponding path program 1 times [2025-03-13 22:00:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26488761] [2025-03-13 22:00:18,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:18,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:18,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:00:18,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:00:18,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:18,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:19,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26488761] [2025-03-13 22:00:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26488761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:19,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:19,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529775225] [2025-03-13 22:00:19,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:19,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:19,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:19,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:19,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 104 [2025-03-13 22:00:19,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03-13 22:00:19,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:19,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 104 [2025-03-13 22:00:19,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:19,258 INFO L124 PetriNetUnfolderBase]: 49/362 cut-off events. [2025-03-13 22:00:19,258 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:00:19,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 362 events. 49/362 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1489 event pairs, 19 based on Foata normal form. 69/373 useless extension candidates. Maximal degree in co-relation 450. Up to 66 conditions per place. [2025-03-13 22:00:19,262 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 16 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-03-13 22:00:19,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 96 transitions, 242 flow [2025-03-13 22:00:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:00:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:00:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-03-13 22:00:19,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9198717948717948 [2025-03-13 22:00:19,285 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 213 flow. Second operand 3 states and 287 transitions. [2025-03-13 22:00:19,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 96 transitions, 242 flow [2025-03-13 22:00:19,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 96 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:00:19,295 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 212 flow [2025-03-13 22:00:19,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2025-03-13 22:00:19,303 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -10 predicate places. [2025-03-13 22:00:19,303 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 212 flow [2025-03-13 22:00:19,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03-13 22:00:19,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:19,303 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] [2025-03-13 22:00:19,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:00:19,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 22:00:19,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2086316715, now seen corresponding path program 1 times [2025-03-13 22:00:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:19,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543700204] [2025-03-13 22:00:19,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:19,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:19,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:00:19,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:00:19,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:19,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543700204] [2025-03-13 22:00:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543700204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553471007] [2025-03-13 22:00:19,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:19,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:19,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:19,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:19,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 104 [2025-03-13 22:00:19,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03-13 22:00:19,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:19,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 104 [2025-03-13 22:00:19,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:19,477 INFO L124 PetriNetUnfolderBase]: 91/603 cut-off events. [2025-03-13 22:00:19,477 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 22:00:19,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 603 events. 91/603 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3201 event pairs, 23 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 843. Up to 105 conditions per place. [2025-03-13 22:00:19,482 INFO L140 encePairwiseOnDemand]: 98/104 looper letters, 16 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2025-03-13 22:00:19,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 98 transitions, 269 flow [2025-03-13 22:00:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:00:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:00:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-03-13 22:00:19,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8878205128205128 [2025-03-13 22:00:19,484 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 212 flow. Second operand 3 states and 277 transitions. [2025-03-13 22:00:19,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 98 transitions, 269 flow [2025-03-13 22:00:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:00:19,487 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 232 flow [2025-03-13 22:00:19,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=92, 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=232, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2025-03-13 22:00:19,488 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -9 predicate places. [2025-03-13 22:00:19,488 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 232 flow [2025-03-13 22:00:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03-13 22:00:19,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:19,488 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:00:19,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:00:19,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 22:00:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 844578280, now seen corresponding path program 1 times [2025-03-13 22:00:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090834405] [2025-03-13 22:00:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:19,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:00:19,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:00:19,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:19,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:00:19,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:00:19,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:00:19,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:00:19,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:19,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:00:19,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:00:19,536 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:00:19,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-13 22:00:19,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-13 22:00:19,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-13 22:00:19,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-13 22:00:19,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-13 22:00:19,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-13 22:00:19,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-13 22:00:19,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-13 22:00:19,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-13 22:00:19,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:00:19,540 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-13 22:00:19,542 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:00:19,542 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:00:19,579 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:00:19,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 172 transitions, 364 flow [2025-03-13 22:00:19,602 INFO L124 PetriNetUnfolderBase]: 5/164 cut-off events. [2025-03-13 22:00:19,602 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:00:19,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 164 events. 5/164 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 360 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 171. Up to 3 conditions per place. [2025-03-13 22:00:19,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 172 transitions, 364 flow [2025-03-13 22:00:19,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 148 transitions, 309 flow [2025-03-13 22:00:19,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:00:19,609 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ac9ab67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:00:19,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-13 22:00:19,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:00:19,614 INFO L124 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-03-13 22:00:19,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:00:19,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:19,614 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] [2025-03-13 22:00:19,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:00:19,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1200021600, now seen corresponding path program 1 times [2025-03-13 22:00:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:19,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872233138] [2025-03-13 22:00:19,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:00:19,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:00:19,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:19,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:19,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:19,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872233138] [2025-03-13 22:00:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872233138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:19,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:19,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652749631] [2025-03-13 22:00:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:19,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:19,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:19,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:19,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 172 [2025-03-13 22:00:19,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 148 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-03-13 22:00:19,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:19,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 172 [2025-03-13 22:00:19,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:20,130 INFO L124 PetriNetUnfolderBase]: 861/3601 cut-off events. [2025-03-13 22:00:20,130 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-03-13 22:00:20,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5109 conditions, 3601 events. 861/3601 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 32018 event pairs, 242 based on Foata normal form. 623/3573 useless extension candidates. Maximal degree in co-relation 5077. Up to 801 conditions per place. [2025-03-13 22:00:20,163 INFO L140 encePairwiseOnDemand]: 155/172 looper letters, 28 selfloop transitions, 8 changer transitions 0/147 dead transitions. [2025-03-13 22:00:20,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 147 transitions, 387 flow [2025-03-13 22:00:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:00:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:00:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-03-13 22:00:20,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2025-03-13 22:00:20,168 INFO L175 Difference]: Start difference. First operand has 151 places, 148 transitions, 309 flow. Second operand 3 states and 456 transitions. [2025-03-13 22:00:20,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 147 transitions, 387 flow [2025-03-13 22:00:20,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 147 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:00:20,170 INFO L231 Difference]: Finished difference. Result has 139 places, 139 transitions, 344 flow [2025-03-13 22:00:20,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=139, PETRI_TRANSITIONS=139} [2025-03-13 22:00:20,173 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, -12 predicate places. [2025-03-13 22:00:20,174 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 139 transitions, 344 flow [2025-03-13 22:00:20,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-03-13 22:00:20,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:20,174 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] [2025-03-13 22:00:20,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:00:20,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:00:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2125429631, now seen corresponding path program 1 times [2025-03-13 22:00:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730174064] [2025-03-13 22:00:20,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:20,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:00:20,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:00:20,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:20,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:20,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:20,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730174064] [2025-03-13 22:00:20,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730174064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767582103] [2025-03-13 22:00:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:20,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:20,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:20,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 172 [2025-03-13 22:00:20,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 139 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-03-13 22:00:20,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:20,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 172 [2025-03-13 22:00:20,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:21,510 INFO L124 PetriNetUnfolderBase]: 2733/10997 cut-off events. [2025-03-13 22:00:21,512 INFO L125 PetriNetUnfolderBase]: For 718/721 co-relation queries the response was YES. [2025-03-13 22:00:21,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16850 conditions, 10997 events. 2733/10997 cut-off events. For 718/721 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 124686 event pairs, 711 based on Foata normal form. 0/9150 useless extension candidates. Maximal degree in co-relation 16817. Up to 2139 conditions per place. [2025-03-13 22:00:21,593 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 28 selfloop transitions, 8 changer transitions 0/155 dead transitions. [2025-03-13 22:00:21,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 456 flow [2025-03-13 22:00:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:00:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:00:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-13 22:00:21,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-03-13 22:00:21,598 INFO L175 Difference]: Start difference. First operand has 139 places, 139 transitions, 344 flow. Second operand 3 states and 444 transitions. [2025-03-13 22:00:21,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 456 flow [2025-03-13 22:00:21,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 155 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:00:21,607 INFO L231 Difference]: Finished difference. Result has 141 places, 147 transitions, 398 flow [2025-03-13 22:00:21,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=141, PETRI_TRANSITIONS=147} [2025-03-13 22:00:21,609 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, -10 predicate places. [2025-03-13 22:00:21,610 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 147 transitions, 398 flow [2025-03-13 22:00:21,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-03-13 22:00:21,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:21,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:00:21,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:00:21,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:00:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:21,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1993032322, now seen corresponding path program 1 times [2025-03-13 22:00:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:21,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214553903] [2025-03-13 22:00:21,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:21,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 22:00:21,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 22:00:21,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:21,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:21,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:21,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214553903] [2025-03-13 22:00:21,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214553903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:21,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:21,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600399456] [2025-03-13 22:00:21,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:21,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:21,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:21,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 172 [2025-03-13 22:00:21,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 147 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 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-03-13 22:00:21,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:21,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 172 [2025-03-13 22:00:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:22,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][46], [113#L695true, 106#L694-4true, 140#L708true, Black: 177#true, 175#true, Black: 182#true, 169#true, 64#L717-1true, 187#true, 184#(= |#race~b~0| 0), 173#true]) [2025-03-13 22:00:22,628 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-13 22:00:22,628 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2025-03-13 22:00:22,628 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 22:00:22,628 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 22:00:22,854 INFO L124 PetriNetUnfolderBase]: 3513/14365 cut-off events. [2025-03-13 22:00:22,855 INFO L125 PetriNetUnfolderBase]: For 911/914 co-relation queries the response was YES. [2025-03-13 22:00:22,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22707 conditions, 14365 events. 3513/14365 cut-off events. For 911/914 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 171481 event pairs, 1504 based on Foata normal form. 0/12088 useless extension candidates. Maximal degree in co-relation 22673. Up to 3347 conditions per place. [2025-03-13 22:00:22,984 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 21 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-03-13 22:00:22,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 156 transitions, 473 flow [2025-03-13 22:00:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:00:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:00:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2025-03-13 22:00:22,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872093023255814 [2025-03-13 22:00:22,987 INFO L175 Difference]: Start difference. First operand has 141 places, 147 transitions, 398 flow. Second operand 3 states and 450 transitions. [2025-03-13 22:00:22,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 156 transitions, 473 flow [2025-03-13 22:00:22,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 156 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:00:22,997 INFO L231 Difference]: Finished difference. Result has 143 places, 151 transitions, 420 flow [2025-03-13 22:00:22,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=143, PETRI_TRANSITIONS=151} [2025-03-13 22:00:22,999 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, -8 predicate places. [2025-03-13 22:00:22,999 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 151 transitions, 420 flow [2025-03-13 22:00:22,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 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-03-13 22:00:23,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:23,000 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:00:23,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:00:23,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-13 22:00:23,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2031906150, now seen corresponding path program 1 times [2025-03-13 22:00:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:23,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909713339] [2025-03-13 22:00:23,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:23,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:00:23,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:00:23,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:23,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:00:23,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:00:23,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:00:23,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:00:23,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:23,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:00:23,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:00:23,045 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:00:23,045 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-03-13 22:00:23,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2025-03-13 22:00:23,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2025-03-13 22:00:23,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2025-03-13 22:00:23,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2025-03-13 22:00:23,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2025-03-13 22:00:23,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:00:23,051 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:00:23,051 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:00:23,051 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:00:23,097 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:00:23,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 240 transitions, 516 flow [2025-03-13 22:00:23,123 INFO L124 PetriNetUnfolderBase]: 6/218 cut-off events. [2025-03-13 22:00:23,124 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:00:23,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 218 events. 6/218 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 598 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 229. Up to 4 conditions per place. [2025-03-13 22:00:23,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 240 transitions, 516 flow [2025-03-13 22:00:23,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 193 transitions, 407 flow [2025-03-13 22:00:23,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:00:23,130 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ac9ab67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:00:23,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-13 22:00:23,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:00:23,132 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2025-03-13 22:00:23,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:00:23,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:23,132 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] [2025-03-13 22:00:23,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-03-13 22:00:23,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1072903302, now seen corresponding path program 1 times [2025-03-13 22:00:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760966289] [2025-03-13 22:00:23,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:23,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:00:23,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:00:23,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:23,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:23,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:23,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760966289] [2025-03-13 22:00:23,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760966289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:23,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:23,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936535776] [2025-03-13 22:00:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:23,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:23,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:23,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:23,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 240 [2025-03-13 22:00:23,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 193 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-03-13 22:00:23,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:23,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 240 [2025-03-13 22:00:23,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:25,589 INFO L124 PetriNetUnfolderBase]: 10763/31322 cut-off events. [2025-03-13 22:00:25,589 INFO L125 PetriNetUnfolderBase]: For 2770/2770 co-relation queries the response was YES. [2025-03-13 22:00:25,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47905 conditions, 31322 events. 10763/31322 cut-off events. For 2770/2770 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 369404 event pairs, 3318 based on Foata normal form. 5288/30823 useless extension candidates. Maximal degree in co-relation 47872. Up to 8400 conditions per place. [2025-03-13 22:00:25,911 INFO L140 encePairwiseOnDemand]: 218/240 looper letters, 38 selfloop transitions, 11 changer transitions 0/195 dead transitions. [2025-03-13 22:00:25,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 195 transitions, 524 flow [2025-03-13 22:00:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:00:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:00:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2025-03-13 22:00:25,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2025-03-13 22:00:25,915 INFO L175 Difference]: Start difference. First operand has 197 places, 193 transitions, 407 flow. Second operand 3 states and 622 transitions. [2025-03-13 22:00:25,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 195 transitions, 524 flow [2025-03-13 22:00:25,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 195 transitions, 519 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:00:25,922 INFO L231 Difference]: Finished difference. Result has 182 places, 184 transitions, 460 flow [2025-03-13 22:00:25,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=182, PETRI_TRANSITIONS=184} [2025-03-13 22:00:25,923 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -15 predicate places. [2025-03-13 22:00:25,923 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 184 transitions, 460 flow [2025-03-13 22:00:25,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-03-13 22:00:25,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:25,923 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] [2025-03-13 22:00:25,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:00:25,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-03-13 22:00:25,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash -267897701, now seen corresponding path program 1 times [2025-03-13 22:00:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:25,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230307437] [2025-03-13 22:00:25,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:25,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:00:25,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:00:25,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:25,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:25,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:25,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230307437] [2025-03-13 22:00:25,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230307437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:25,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:25,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:25,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838027999] [2025-03-13 22:00:25,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:25,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:25,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:25,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:26,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 240 [2025-03-13 22:00:26,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 184 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-03-13 22:00:26,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:26,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 240 [2025-03-13 22:00:26,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:34,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork1_#t~nondet3_3|) InVars {thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][85], [171#L707-2true, 124#L694-5true, 241#true, 229#L695true, 233#true, 243#true, Black: 247#(= |#race~a~0| 0), 129#L694-5true, 245#true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:34,876 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-13 22:00:34,876 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-13 22:00:34,877 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-13 22:00:34,877 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-13 22:00:35,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork1_#t~nondet3_3|) InVars {thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][85], [182#L707-1true, 124#L694-5true, 241#true, 229#L695true, 233#true, Black: 247#(= |#race~a~0| 0), 243#true, 245#true, 129#L694-5true, 252#(= |#race~b~0| 0), 239#true, 54#L717-1true]) [2025-03-13 22:00:35,273 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-03-13 22:00:35,273 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-13 22:00:35,273 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-03-13 22:00:35,273 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-13 22:00:35,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([735] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][140], [225#L695-4true, 227#L706true, 247#(= |#race~a~0| 0), 241#true, 233#true, 243#true, Black: 245#true, 131#L695-4true, 129#L694-5true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:35,453 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-03-13 22:00:35,453 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-13 22:00:35,453 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-13 22:00:35,453 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-13 22:00:35,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork1_#t~nondet3_3|) InVars {thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][85], [124#L694-5true, 227#L706true, 241#true, 229#L695true, 122#L694-4true, 233#true, 243#true, Black: 247#(= |#race~a~0| 0), 245#true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:35,670 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-03-13 22:00:35,670 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-03-13 22:00:35,670 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 22:00:35,670 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-13 22:00:35,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([735] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][140], [225#L695-4true, 227#L706true, 247#(= |#race~a~0| 0), 241#true, 233#true, 243#true, Black: 245#true, 22#L695-5true, 129#L694-5true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:35,672 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-13 22:00:35,672 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-13 22:00:35,672 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-13 22:00:35,672 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-13 22:00:35,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork1_#t~nondet3_3|) InVars {thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][85], [25#L708true, 124#L694-5true, 241#true, 229#L695true, 233#true, 243#true, Black: 247#(= |#race~a~0| 0), 129#L694-5true, 245#true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:35,689 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-03-13 22:00:35,689 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-13 22:00:35,689 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-13 22:00:35,689 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-13 22:00:35,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork1_#t~nondet3_3|) InVars {thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][85], [124#L694-5true, 227#L706true, 241#true, 229#L695true, 233#true, 243#true, Black: 247#(= |#race~a~0| 0), 129#L694-5true, 245#true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:35,887 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-13 22:00:35,887 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-13 22:00:35,887 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-13 22:00:35,887 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork1_#t~nondet3_3|) InVars {thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][85], [189#L694-4true, 227#L706true, 241#true, 229#L695true, 233#true, 243#true, Black: 247#(= |#race~a~0| 0), 129#L694-5true, 245#true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:36,326 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([652] L695-2-->L695: Formula: (= |v_#race~a~0_3| |v_thr2Thread1of3ForFork1_#t~nondet3_3|) InVars {thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|} OutVars{thr2Thread1of3ForFork1_#t~nondet3=|v_thr2Thread1of3ForFork1_#t~nondet3_3|, #race~a~0=|v_#race~a~0_3|} AuxVars[] AssignedVars[#race~a~0][85], [124#L694-5true, 227#L706true, 241#true, 229#L695true, 233#true, 243#true, Black: 247#(= |#race~a~0| 0), 129#L694-5true, 245#true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:36,326 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-13 22:00:36,326 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-13 22:00:37,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([735] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][140], [225#L695-4true, 116#L695-5true, 227#L706true, 247#(= |#race~a~0| 0), 241#true, 229#L695true, 233#true, 243#true, Black: 245#true, 239#true, 252#(= |#race~b~0| 0), 54#L717-1true]) [2025-03-13 22:00:37,555 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2025-03-13 22:00:37,555 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-13 22:00:37,555 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-13 22:00:37,555 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-13 22:00:38,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([795] L707-4-->L707-2: Formula: (= |v_#race~b~0_9| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_9|} AuxVars[] AssignedVars[#race~b~0][34], [171#L707-2true, 208#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 247#(= |#race~a~0| 0), 15#L695true, 241#true, 233#true, 243#true, Black: 245#true, 239#true, 252#(= |#race~b~0| 0), 222#L693true, 54#L717-1true]) [2025-03-13 22:00:38,922 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-03-13 22:00:38,922 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-13 22:00:38,922 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-13 22:00:38,922 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 22:00:38,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][75], [208#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 247#(= |#race~a~0| 0), 15#L695true, 241#true, 122#L694-4true, 164#L707-3true, 233#true, 250#true, 243#true, Black: 245#true, 239#true, 54#L717-1true]) [2025-03-13 22:00:38,940 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-03-13 22:00:38,940 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-13 22:00:38,940 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-13 22:00:38,940 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-13 22:00:38,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][75], [208#thr2Err7ASSERT_VIOLATIONDATA_RACEtrue, 247#(= |#race~a~0| 0), 15#L695true, 241#true, 122#L694-4true, 233#true, 250#true, 243#true, Black: 245#true, 84#L707-4true, 239#true, 54#L717-1true]) [2025-03-13 22:00:38,940 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2025-03-13 22:00:38,940 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-13 22:00:38,940 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-13 22:00:38,940 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-13 22:00:39,109 INFO L124 PetriNetUnfolderBase]: 52970/160872 cut-off events. [2025-03-13 22:00:39,110 INFO L125 PetriNetUnfolderBase]: For 11564/11735 co-relation queries the response was YES. [2025-03-13 22:00:40,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257585 conditions, 160872 events. 52970/160872 cut-off events. For 11564/11735 co-relation queries the response was YES. Maximal size of possible extension queue 4761. Compared 2462464 event pairs, 15099 based on Foata normal form. 0/133500 useless extension candidates. Maximal degree in co-relation 257551. Up to 35464 conditions per place. [2025-03-13 22:00:41,053 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 38 selfloop transitions, 11 changer transitions 0/206 dead transitions. [2025-03-13 22:00:41,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 206 transitions, 615 flow [2025-03-13 22:00:41,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:00:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:00:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-03-13 22:00:41,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2025-03-13 22:00:41,055 INFO L175 Difference]: Start difference. First operand has 182 places, 184 transitions, 460 flow. Second operand 3 states and 608 transitions. [2025-03-13 22:00:41,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 206 transitions, 615 flow [2025-03-13 22:00:41,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 206 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:00:41,115 INFO L231 Difference]: Finished difference. Result has 184 places, 195 transitions, 534 flow [2025-03-13 22:00:41,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=184, PETRI_TRANSITIONS=195} [2025-03-13 22:00:41,116 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -13 predicate places. [2025-03-13 22:00:41,116 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 195 transitions, 534 flow [2025-03-13 22:00:41,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-03-13 22:00:41,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:00:41,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:00:41,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:00:41,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err7ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err5ASSERT_VIOLATIONDATA_RACE, thr2Err4ASSERT_VIOLATIONDATA_RACE (and 38 more)] === [2025-03-13 22:00:41,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:00:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1655101219, now seen corresponding path program 1 times [2025-03-13 22:00:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:00:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545979693] [2025-03-13 22:00:41,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:00:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:00:41,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 22:00:41,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 22:00:41,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:00:41,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:00:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:00:41,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:00:41,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545979693] [2025-03-13 22:00:41,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545979693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:00:41,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:00:41,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:00:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105955299] [2025-03-13 22:00:41,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:00:41,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:00:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:00:41,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:00:41,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:00:41,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 240 [2025-03-13 22:00:41,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 195 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 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-03-13 22:00:41,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:00:41,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 240 [2025-03-13 22:00:41,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:00:45,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][112], [233#true, 229#L695true, 243#true, 252#(= |#race~b~0| 0), 239#true, 54#L717-1true, 146#L695-4true, 171#L707-2true, 241#true, 255#true, 165#L695-5true, Black: 245#true, Black: 250#true]) [2025-03-13 22:00:45,630 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-13 22:00:45,630 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 22:00:45,630 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 22:00:45,630 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-13 22:00:45,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([691] L695-6-->L695-4: Formula: (= |v_#race~b~0_6| 0) InVars {} OutVars{#race~b~0=|v_#race~b~0_6|} AuxVars[] AssignedVars[#race~b~0][112], [233#true, 229#L695true, 243#true, 252#(= |#race~b~0| 0), 239#true, 54#L717-1true, 146#L695-4true, 182#L707-1true, 241#true, 255#true, 165#L695-5true, Black: 245#true, Black: 250#true]) [2025-03-13 22:00:45,993 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-13 22:00:45,993 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-13 22:00:45,993 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-13 22:00:45,993 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-13 22:00:49,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][48], [75#L695true, 25#L708true, 241#true, 233#true, 255#true, 242#true, Black: 245#true, 62#L694-4true, 252#(= |#race~b~0| 0), 239#true, Black: 250#true, 54#L717-1true]) [2025-03-13 22:00:49,562 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-13 22:00:49,562 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 22:00:49,562 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2025-03-13 22:00:49,562 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-13 22:00:51,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L694-2-->L694: Formula: (= |v_#race~temp~0_6| |v_thr2Thread3of3ForFork1_#t~nondet2_3|) InVars {thr2Thread3of3ForFork1_#t~nondet2=|v_thr2Thread3of3ForFork1_#t~nondet2_3|} OutVars{#race~temp~0=|v_#race~temp~0_6|, thr2Thread3of3ForFork1_#t~nondet2=|v_thr2Thread3of3ForFork1_#t~nondet2_3|} AuxVars[] AssignedVars[#race~temp~0][104], [75#L695true, 139#L697-4true, 233#true, 243#true, 252#(= |#race~b~0| 0), 239#true, 54#L717-1true, 25#L708true, 241#true, 255#true, Black: 245#true, 64#L694true, Black: 250#true]) [2025-03-13 22:00:51,770 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-03-13 22:00:51,770 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 22:00:51,770 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 22:00:51,770 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-13 22:00:52,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([801] L708-3-->L708: Formula: (and (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#mutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#mutex~0.base_21|) |v_~#mutex~0.offset_21| 0))) (= |v_thr1Thread1of3ForFork0_#t~ret8#1_1| 0)) InVars {~#mutex~0.base=|v_~#mutex~0.base_21|, ~#mutex~0.offset=|v_~#mutex~0.offset_21|, #pthreadsMutex=|v_#pthreadsMutex_30|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_21|, #pthreadsMutex=|v_#pthreadsMutex_29|, thr1Thread1of3ForFork0_#t~ret8#1=|v_thr1Thread1of3ForFork0_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_21|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork0_#t~ret8#1][44], [139#L697-4true, 233#true, 243#true, 252#(= |#race~b~0| 0), 239#true, 54#L717-1true, 125#L694true, 25#L708true, 241#true, 255#true, Black: 245#true, 64#L694true, Black: 250#true]) [2025-03-13 22:00:52,212 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-13 22:00:52,212 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-13 22:00:52,212 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-13 22:00:52,212 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-13 22:00:52,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([801] L708-3-->L708: Formula: (and (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#mutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#mutex~0.base_21|) |v_~#mutex~0.offset_21| 0))) (= |v_thr1Thread1of3ForFork0_#t~ret8#1_1| 0)) InVars {~#mutex~0.base=|v_~#mutex~0.base_21|, ~#mutex~0.offset=|v_~#mutex~0.offset_21|, #pthreadsMutex=|v_#pthreadsMutex_30|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_21|, #pthreadsMutex=|v_#pthreadsMutex_29|, thr1Thread1of3ForFork0_#t~ret8#1=|v_thr1Thread1of3ForFork0_#t~ret8#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_21|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread1of3ForFork0_#t~ret8#1][44], [233#true, 243#true, 62#L694-4true, 252#(= |#race~b~0| 0), 239#true, 54#L717-1true, 25#L708true, 194#L693true, 241#true, 255#true, Black: 245#true, 222#L693true, Black: 250#true]) [2025-03-13 22:00:52,243 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-13 22:00:52,243 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-03-13 22:00:52,243 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-13 22:00:52,243 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-13 22:00:53,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([682] L694-6-->L694-4: Formula: (= |v_#race~a~0_6| 0) InVars {} OutVars{#race~a~0=|v_#race~a~0_6|} AuxVars[] AssignedVars[#race~a~0][63], [233#true, 122#L694-4true, 243#true, 148#thr2ENTRYtrue, 252#(= |#race~b~0| 0), 239#true, 54#L717-1true, 25#L708true, 15#L695true, 241#true, 255#true, Black: 245#true, Black: 250#true]) [2025-03-13 22:00:53,207 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-03-13 22:00:53,207 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-13 22:00:53,207 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-03-13 22:00:53,207 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event