./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.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-race-challenges/per-thread-struct-tid.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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:29:17,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:29:17,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:29:17,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:29:17,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:29:17,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:29:17,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:29:17,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:29:17,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:29:17,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:29:17,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:29:17,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:29:17,518 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:29:17,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:29:17,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:29:17,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:29:17,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:29:17,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:29:17,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:29:17,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:29:17,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:29:17,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:29:17,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:29:17,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:17,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:29:17,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:29:17,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:29:17,521 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2025-03-13 22:29:17,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:29:17,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:29:17,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:29:17,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:29:17,753 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:29:17,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2025-03-13 22:29:18,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8d2c28f/da5dbc1bd6df4e969ac8413c0c0c5f39/FLAG3d1628297 [2025-03-13 22:29:19,210 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:29:19,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2025-03-13 22:29:19,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8d2c28f/da5dbc1bd6df4e969ac8413c0c0c5f39/FLAG3d1628297 [2025-03-13 22:29:19,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8d2c28f/da5dbc1bd6df4e969ac8413c0c0c5f39 [2025-03-13 22:29:19,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:29:19,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:29:19,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:19,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:29:19,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:29:19,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505924de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19, skipping insertion in model container [2025-03-13 22:29:19,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:29:19,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:19,544 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:29:19,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:19,616 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:29:19,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19 WrapperNode [2025-03-13 22:29:19,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:19,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:19,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:29:19,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:29:19,622 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:29:19" (1/1) ... [2025-03-13 22:29:19,634 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:29:19" (1/1) ... [2025-03-13 22:29:19,648 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-13 22:29:19,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:19,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:29:19,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:29:19,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:29:19,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:29:19,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:29:19,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:29:19,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:29:19,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (1/1) ... [2025-03-13 22:29:19,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:19,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:19,696 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:29:19,698 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:29:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:29:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:29:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:29:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:29:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:29:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:29:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:29:19,716 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:29:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:29:19,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:29:19,717 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:29:19,807 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:29:19,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:29:19,986 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:29:19,987 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:29:19,987 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:29:19,995 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:29:19,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:19 BoogieIcfgContainer [2025-03-13 22:29:19,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:29:19,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:29:19,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:29:20,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:29:20,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:29:19" (1/3) ... [2025-03-13 22:29:20,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219097b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:20, skipping insertion in model container [2025-03-13 22:29:20,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:19" (2/3) ... [2025-03-13 22:29:20,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219097b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:20, skipping insertion in model container [2025-03-13 22:29:20,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:19" (3/3) ... [2025-03-13 22:29:20,004 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2025-03-13 22:29:20,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:29:20,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-struct-tid.i that has 2 procedures, 106 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-13 22:29:20,015 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:29:20,060 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:29:20,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 223 flow [2025-03-13 22:29:20,138 INFO L124 PetriNetUnfolderBase]: 2/156 cut-off events. [2025-03-13 22:29:20,140 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:29:20,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 156 events. 2/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 219 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-03-13 22:29:20,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 108 transitions, 223 flow [2025-03-13 22:29:20,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 108 transitions, 223 flow [2025-03-13 22:29:20,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:20,159 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;@7272712b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:20,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-13 22:29:20,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:20,166 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-03-13 22:29:20,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:20,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:20,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:20,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash -90682818, now seen corresponding path program 1 times [2025-03-13 22:29:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707406160] [2025-03-13 22:29:20,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:20,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 22:29:20,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 22:29:20,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:20,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:20,506 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:29:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707406160] [2025-03-13 22:29:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707406160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195315044] [2025-03-13 22:29:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:20,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:20,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:20,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:20,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2025-03-13 22:29:20,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:20,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:20,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2025-03-13 22:29:20,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:20,716 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2025-03-13 22:29:20,717 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:29:20,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 161 events. 1/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. [2025-03-13 22:29:20,720 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 11 selfloop transitions, 2 changer transitions 6/112 dead transitions. [2025-03-13 22:29:20,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 267 flow [2025-03-13 22:29:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-03-13 22:29:20,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2025-03-13 22:29:20,735 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 223 flow. Second operand 6 states and 584 transitions. [2025-03-13 22:29:20,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 267 flow [2025-03-13 22:29:20,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:20,758 INFO L231 Difference]: Finished difference. Result has 118 places, 106 transitions, 237 flow [2025-03-13 22:29:20,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=118, PETRI_TRANSITIONS=106} [2025-03-13 22:29:20,762 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2025-03-13 22:29:20,762 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 106 transitions, 237 flow [2025-03-13 22:29:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:29:20,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:20,763 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:29:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:29:20,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:20,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1368358570, now seen corresponding path program 1 times [2025-03-13 22:29:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-03-13 22:29:20,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:20,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:29:20,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:29:20,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:20,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:21,124 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:29:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863702791] [2025-03-13 22:29:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863702791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:21,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:21,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:21,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890635203] [2025-03-13 22:29:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:21,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:21,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:21,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:21,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 108 [2025-03-13 22:29:21,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 106 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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:29:21,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:21,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 108 [2025-03-13 22:29:21,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:21,513 INFO L124 PetriNetUnfolderBase]: 106/500 cut-off events. [2025-03-13 22:29:21,514 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 22:29:21,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 500 events. 106/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2433 event pairs, 68 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 692. Up to 240 conditions per place. [2025-03-13 22:29:21,517 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 35 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2025-03-13 22:29:21,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 393 flow [2025-03-13 22:29:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-03-13 22:29:21,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2025-03-13 22:29:21,519 INFO L175 Difference]: Start difference. First operand has 118 places, 106 transitions, 237 flow. Second operand 6 states and 484 transitions. [2025-03-13 22:29:21,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 393 flow [2025-03-13 22:29:21,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 379 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:21,522 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 373 flow [2025-03-13 22:29:21,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2025-03-13 22:29:21,522 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2025-03-13 22:29:21,523 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 373 flow [2025-03-13 22:29:21,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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:29:21,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:21,523 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:29:21,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:29:21,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:21,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash -800255098, now seen corresponding path program 1 times [2025-03-13 22:29:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404410376] [2025-03-13 22:29:21,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:21,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 22:29:21,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 22:29:21,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:21,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:21,788 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:29:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404410376] [2025-03-13 22:29:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404410376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:21,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:21,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:21,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398811763] [2025-03-13 22:29:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:21,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:21,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:21,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:21,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 108 [2025-03-13 22:29:21,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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:29:21,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:21,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 108 [2025-03-13 22:29:21,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:21,970 INFO L124 PetriNetUnfolderBase]: 125/565 cut-off events. [2025-03-13 22:29:21,971 INFO L125 PetriNetUnfolderBase]: For 108/114 co-relation queries the response was YES. [2025-03-13 22:29:21,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 565 events. 125/565 cut-off events. For 108/114 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2809 event pairs, 55 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 998. Up to 268 conditions per place. [2025-03-13 22:29:21,974 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 52 selfloop transitions, 22 changer transitions 0/148 dead transitions. [2025-03-13 22:29:21,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 595 flow [2025-03-13 22:29:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-03-13 22:29:21,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623456790123457 [2025-03-13 22:29:21,975 INFO L175 Difference]: Start difference. First operand has 119 places, 127 transitions, 373 flow. Second operand 6 states and 494 transitions. [2025-03-13 22:29:21,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 595 flow [2025-03-13 22:29:21,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:21,979 INFO L231 Difference]: Finished difference. Result has 129 places, 148 transitions, 555 flow [2025-03-13 22:29:21,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=129, PETRI_TRANSITIONS=148} [2025-03-13 22:29:21,979 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places. [2025-03-13 22:29:21,980 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 148 transitions, 555 flow [2025-03-13 22:29:21,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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:29:21,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:21,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:21,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:29:21,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:21,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:21,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1947607354, now seen corresponding path program 1 times [2025-03-13 22:29:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:21,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311957702] [2025-03-13 22:29:21,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:21,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:21,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:29:21,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:29:21,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:21,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:22,208 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:29:22,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:22,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311957702] [2025-03-13 22:29:22,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311957702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:22,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:22,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:22,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320750015] [2025-03-13 22:29:22,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:22,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:22,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:22,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:22,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2025-03-13 22:29:22,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 148 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:29:22,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:22,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2025-03-13 22:29:22,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:22,481 INFO L124 PetriNetUnfolderBase]: 283/933 cut-off events. [2025-03-13 22:29:22,481 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES. [2025-03-13 22:29:22,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 933 events. 283/933 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5285 event pairs, 47 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2159. Up to 489 conditions per place. [2025-03-13 22:29:22,486 INFO L140 encePairwiseOnDemand]: 85/108 looper letters, 60 selfloop transitions, 90 changer transitions 7/229 dead transitions. [2025-03-13 22:29:22,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 229 transitions, 1163 flow [2025-03-13 22:29:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2025-03-13 22:29:22,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595679012345679 [2025-03-13 22:29:22,488 INFO L175 Difference]: Start difference. First operand has 129 places, 148 transitions, 555 flow. Second operand 6 states and 557 transitions. [2025-03-13 22:29:22,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 229 transitions, 1163 flow [2025-03-13 22:29:22,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 229 transitions, 1125 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:22,498 INFO L231 Difference]: Finished difference. Result has 139 places, 222 transitions, 1239 flow [2025-03-13 22:29:22,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1239, PETRI_PLACES=139, PETRI_TRANSITIONS=222} [2025-03-13 22:29:22,499 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 30 predicate places. [2025-03-13 22:29:22,500 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 222 transitions, 1239 flow [2025-03-13 22:29:22,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:29:22,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:22,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:22,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:29:22,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:22,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1593160032, now seen corresponding path program 1 times [2025-03-13 22:29:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:22,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503034255] [2025-03-13 22:29:22,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:22,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:29:22,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:29:22,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:22,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:22,738 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:29:22,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503034255] [2025-03-13 22:29:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503034255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641770579] [2025-03-13 22:29:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:22,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:22,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:22,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:22,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 108 [2025-03-13 22:29:22,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 222 transitions, 1239 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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:29:22,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:22,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 108 [2025-03-13 22:29:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:23,089 INFO L124 PetriNetUnfolderBase]: 282/973 cut-off events. [2025-03-13 22:29:23,090 INFO L125 PetriNetUnfolderBase]: For 1094/1186 co-relation queries the response was YES. [2025-03-13 22:29:23,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 973 events. 282/973 cut-off events. For 1094/1186 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6042 event pairs, 18 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 2922. Up to 400 conditions per place. [2025-03-13 22:29:23,098 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 125 selfloop transitions, 36 changer transitions 0/252 dead transitions. [2025-03-13 22:29:23,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 252 transitions, 1770 flow [2025-03-13 22:29:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-03-13 22:29:23,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7808641975308642 [2025-03-13 22:29:23,101 INFO L175 Difference]: Start difference. First operand has 139 places, 222 transitions, 1239 flow. Second operand 6 states and 506 transitions. [2025-03-13 22:29:23,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 252 transitions, 1770 flow [2025-03-13 22:29:23,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 252 transitions, 1734 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:23,115 INFO L231 Difference]: Finished difference. Result has 141 places, 251 transitions, 1589 flow [2025-03-13 22:29:23,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=141, PETRI_TRANSITIONS=251} [2025-03-13 22:29:23,116 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 32 predicate places. [2025-03-13 22:29:23,116 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 251 transitions, 1589 flow [2025-03-13 22:29:23,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 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:29:23,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:23,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:23,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:29:23,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:23,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1625837938, now seen corresponding path program 1 times [2025-03-13 22:29:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:23,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982427560] [2025-03-13 22:29:23,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:23,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:29:23,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:29:23,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:23,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:23,369 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:29:23,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982427560] [2025-03-13 22:29:23,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982427560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:23,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:23,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412330264] [2025-03-13 22:29:23,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:23,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:23,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:23,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:23,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 108 [2025-03-13 22:29:23,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 251 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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:29:23,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:23,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 108 [2025-03-13 22:29:23,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:23,665 INFO L124 PetriNetUnfolderBase]: 324/1067 cut-off events. [2025-03-13 22:29:23,665 INFO L125 PetriNetUnfolderBase]: For 1941/2035 co-relation queries the response was YES. [2025-03-13 22:29:23,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1067 events. 324/1067 cut-off events. For 1941/2035 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6747 event pairs, 21 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 3604. Up to 441 conditions per place. [2025-03-13 22:29:23,671 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 136 selfloop transitions, 37 changer transitions 29/291 dead transitions. [2025-03-13 22:29:23,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 291 transitions, 2350 flow [2025-03-13 22:29:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2025-03-13 22:29:23,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395061728395061 [2025-03-13 22:29:23,673 INFO L175 Difference]: Start difference. First operand has 141 places, 251 transitions, 1589 flow. Second operand 6 states and 544 transitions. [2025-03-13 22:29:23,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 291 transitions, 2350 flow [2025-03-13 22:29:23,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 291 transitions, 2192 flow, removed 79 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:23,689 INFO L231 Difference]: Finished difference. Result has 151 places, 262 transitions, 1852 flow [2025-03-13 22:29:23,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1852, PETRI_PLACES=151, PETRI_TRANSITIONS=262} [2025-03-13 22:29:23,690 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 42 predicate places. [2025-03-13 22:29:23,690 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 262 transitions, 1852 flow [2025-03-13 22:29:23,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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:29:23,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:23,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:23,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:29:23,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:23,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -811156847, now seen corresponding path program 1 times [2025-03-13 22:29:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134420241] [2025-03-13 22:29:23,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:23,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:29:23,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:29:23,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:23,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:24,064 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:29:24,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134420241] [2025-03-13 22:29:24,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134420241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:24,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:24,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:29:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960545268] [2025-03-13 22:29:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:29:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:24,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:29:24,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:29:24,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 108 [2025-03-13 22:29:24,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 262 transitions, 1852 flow. Second operand has 14 states, 14 states have (on average 65.85714285714286) internal successors, (922), 14 states have internal predecessors, (922), 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:29:24,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:24,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 108 [2025-03-13 22:29:24,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:25,759 INFO L124 PetriNetUnfolderBase]: 405/1210 cut-off events. [2025-03-13 22:29:25,760 INFO L125 PetriNetUnfolderBase]: For 2541/2592 co-relation queries the response was YES. [2025-03-13 22:29:25,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1210 events. 405/1210 cut-off events. For 2541/2592 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7658 event pairs, 23 based on Foata normal form. 46/1252 useless extension candidates. Maximal degree in co-relation 4626. Up to 329 conditions per place. [2025-03-13 22:29:25,767 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 206 selfloop transitions, 166 changer transitions 0/426 dead transitions. [2025-03-13 22:29:25,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 426 transitions, 3726 flow [2025-03-13 22:29:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-13 22:29:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-13 22:29:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2510 transitions. [2025-03-13 22:29:25,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6455761316872428 [2025-03-13 22:29:25,773 INFO L175 Difference]: Start difference. First operand has 151 places, 262 transitions, 1852 flow. Second operand 36 states and 2510 transitions. [2025-03-13 22:29:25,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 426 transitions, 3726 flow [2025-03-13 22:29:25,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 426 transitions, 3642 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:25,795 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 2820 flow [2025-03-13 22:29:25,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2820, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2025-03-13 22:29:25,797 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 74 predicate places. [2025-03-13 22:29:25,798 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 330 transitions, 2820 flow [2025-03-13 22:29:25,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 65.85714285714286) internal successors, (922), 14 states have internal predecessors, (922), 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:29:25,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:25,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:29:25,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1629204000, now seen corresponding path program 1 times [2025-03-13 22:29:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934424596] [2025-03-13 22:29:25,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:25,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:29:25,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:29:25,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:25,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:26,153 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:29:26,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934424596] [2025-03-13 22:29:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934424596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:26,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:26,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:29:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573179443] [2025-03-13 22:29:26,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:26,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:29:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:26,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:29:26,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:29:26,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 108 [2025-03-13 22:29:26,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 330 transitions, 2820 flow. Second operand has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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:29:26,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:26,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 108 [2025-03-13 22:29:26,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:27,497 INFO L124 PetriNetUnfolderBase]: 402/1290 cut-off events. [2025-03-13 22:29:27,498 INFO L125 PetriNetUnfolderBase]: For 4824/4854 co-relation queries the response was YES. [2025-03-13 22:29:27,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 1290 events. 402/1290 cut-off events. For 4824/4854 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8460 event pairs, 13 based on Foata normal form. 13/1298 useless extension candidates. Maximal degree in co-relation 5596. Up to 343 conditions per place. [2025-03-13 22:29:27,507 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 253 selfloop transitions, 73 changer transitions 0/418 dead transitions. [2025-03-13 22:29:27,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 418 transitions, 4401 flow [2025-03-13 22:29:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-13 22:29:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-13 22:29:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1808 transitions. [2025-03-13 22:29:27,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6438746438746439 [2025-03-13 22:29:27,514 INFO L175 Difference]: Start difference. First operand has 183 places, 330 transitions, 2820 flow. Second operand 26 states and 1808 transitions. [2025-03-13 22:29:27,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 418 transitions, 4401 flow [2025-03-13 22:29:27,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 418 transitions, 4147 flow, removed 100 selfloop flow, removed 8 redundant places. [2025-03-13 22:29:27,547 INFO L231 Difference]: Finished difference. Result has 205 places, 355 transitions, 3066 flow [2025-03-13 22:29:27,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3066, PETRI_PLACES=205, PETRI_TRANSITIONS=355} [2025-03-13 22:29:27,549 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 96 predicate places. [2025-03-13 22:29:27,550 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 355 transitions, 3066 flow [2025-03-13 22:29:27,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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:29:27,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:27,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:29:27,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:27,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1774847060, now seen corresponding path program 2 times [2025-03-13 22:29:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:27,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121674527] [2025-03-13 22:29:27,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:29:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:27,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:29:27,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:29:27,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:29:27,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:27,885 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:29:27,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:27,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121674527] [2025-03-13 22:29:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121674527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:27,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:27,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:29:27,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733425222] [2025-03-13 22:29:27,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:27,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:29:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:29:27,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:29:28,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 108 [2025-03-13 22:29:28,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 355 transitions, 3066 flow. Second operand has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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:29:28,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:28,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 108 [2025-03-13 22:29:28,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:29,150 INFO L124 PetriNetUnfolderBase]: 493/1582 cut-off events. [2025-03-13 22:29:29,150 INFO L125 PetriNetUnfolderBase]: For 6112/6219 co-relation queries the response was YES. [2025-03-13 22:29:29,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 1582 events. 493/1582 cut-off events. For 6112/6219 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11355 event pairs, 12 based on Foata normal form. 23/1593 useless extension candidates. Maximal degree in co-relation 6917. Up to 446 conditions per place. [2025-03-13 22:29:29,161 INFO L140 encePairwiseOnDemand]: 88/108 looper letters, 245 selfloop transitions, 95 changer transitions 0/432 dead transitions. [2025-03-13 22:29:29,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 432 transitions, 4576 flow [2025-03-13 22:29:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-13 22:29:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-13 22:29:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1538 transitions. [2025-03-13 22:29:29,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473063973063973 [2025-03-13 22:29:29,166 INFO L175 Difference]: Start difference. First operand has 205 places, 355 transitions, 3066 flow. Second operand 22 states and 1538 transitions. [2025-03-13 22:29:29,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 432 transitions, 4576 flow [2025-03-13 22:29:29,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 432 transitions, 4507 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-03-13 22:29:29,199 INFO L231 Difference]: Finished difference. Result has 216 places, 386 transitions, 3741 flow [2025-03-13 22:29:29,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2997, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3741, PETRI_PLACES=216, PETRI_TRANSITIONS=386} [2025-03-13 22:29:29,200 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 107 predicate places. [2025-03-13 22:29:29,200 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 386 transitions, 3741 flow [2025-03-13 22:29:29,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.85714285714286) internal successors, (936), 14 states have internal predecessors, (936), 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:29:29,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:29,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:29,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:29:29,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:29:29,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1312682788, now seen corresponding path program 3 times [2025-03-13 22:29:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-03-13 22:29:29,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:29:29,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:29,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 2 equivalence classes. [2025-03-13 22:29:29,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:29:29,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 22:29:29,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:29,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-03-13 22:29:29,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136135805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:29:29,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997450876] [2025-03-13 22:29:29,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:29:29,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:29,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:29,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:29,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:29:29,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 2 equivalence classes. [2025-03-13 22:29:29,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:29:29,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 22:29:29,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:29,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-13 22:29:29,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:29,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-13 22:29:29,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-13 22:29:29,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-13 22:29:30,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:29:30,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-13 22:29:30,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-13 22:29:30,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-13 22:29:30,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2025-03-13 22:29:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:30,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:30:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:30:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997450876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:30:01,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:30:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 39 [2025-03-13 22:30:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632320426] [2025-03-13 22:30:01,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:30:01,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-13 22:30:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:30:01,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-13 22:30:01,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1342, Unknown=7, NotChecked=0, Total=1560 [2025-03-13 22:30:06,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:10,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:14,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:18,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:22,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:26,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:30,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:35,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:39,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:44,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:48,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:53,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-13 22:30:57,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]