./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:29:10,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:29:10,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:29:10,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:29:10,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:29:10,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:29:10,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:29:10,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:29:10,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:29:10,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:29:10,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:29:10,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:29:10,249 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:29:10,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:29:10,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:29:10,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:29:10,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:29:10,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:10,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:10,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:29:10,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:29:10,251 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 -> 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e [2025-04-30 10:29:10,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:29:10,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:29:10,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:29:10,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:29:10,474 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:29:10,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.i [2025-04-30 10:29:11,799 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b540e9024/7d54520eb21b466dbdcf958e1f097576/FLAGcfee35bc4 [2025-04-30 10:29:12,046 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:29:12,047 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race.i [2025-04-30 10:29:12,057 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b540e9024/7d54520eb21b466dbdcf958e1f097576/FLAGcfee35bc4 [2025-04-30 10:29:12,999 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b540e9024/7d54520eb21b466dbdcf958e1f097576 [2025-04-30 10:29:13,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:29:13,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:29:13,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:13,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:29:13,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:29:13,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca6c2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13, skipping insertion in model container [2025-04-30 10:29:13,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:29:13,436 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:13,443 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:29:13,508 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:13,552 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:29:13,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13 WrapperNode [2025-04-30 10:29:13,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:13,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:13,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:29:13,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:29:13,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,585 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-04-30 10:29:13,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:13,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:29:13,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:29:13,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:29:13,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:29:13,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:29:13,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:29:13,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:29:13,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (1/1) ... [2025-04-30 10:29:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:13,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:29:13,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:29:13,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:29:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:29:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:29:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:29:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:29:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:29:13,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:29:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:29:13,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:29:13,671 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:29:13,750 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:29:13,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:29:13,899 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:29:13,899 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:29:13,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:29:13,909 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:29:13,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:13 BoogieIcfgContainer [2025-04-30 10:29:13,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:29:13,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:29:13,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:29:13,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:29:13,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:29:13" (1/3) ... [2025-04-30 10:29:13,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4d8961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:13, skipping insertion in model container [2025-04-30 10:29:13,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:13" (2/3) ... [2025-04-30 10:29:13,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4d8961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:13, skipping insertion in model container [2025-04-30 10:29:13,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:13" (3/3) ... [2025-04-30 10:29:13,916 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i [2025-04-30 10:29:13,925 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:29:13,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index-race.i that has 2 procedures, 93 locations, 94 edges, 1 initial locations, 2 loop locations, and 6 error locations. [2025-04-30 10:29:13,927 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:29:13,970 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:29:14,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 95 transitions, 197 flow [2025-04-30 10:29:14,059 INFO L116 PetriNetUnfolderBase]: 2/128 cut-off events. [2025-04-30 10:29:14,061 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:29:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 2/128 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-04-30 10:29:14,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 95 transitions, 197 flow [2025-04-30 10:29:14,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 95 transitions, 197 flow [2025-04-30 10:29:14,076 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:14,088 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6fd60966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:14,090 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:29:14,097 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:14,097 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-30 10:29:14,097 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:14,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:14,098 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] [2025-04-30 10:29:14,099 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:29:14,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -881325618, now seen corresponding path program 1 times [2025-04-30 10:29:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:14,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889129399] [2025-04-30 10:29:14,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:14,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:29:14,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:29:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:14,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889129399] [2025-04-30 10:29:14,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889129399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:14,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:14,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055288503] [2025-04-30 10:29:14,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:14,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:14,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:14,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:14,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2025-04-30 10:29:14,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:14,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2025-04-30 10:29:14,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:14,353 INFO L116 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-04-30 10:29:14,353 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:29:14,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 162 events. 3/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 326 event pairs, 2 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 102. Up to 15 conditions per place. [2025-04-30 10:29:14,355 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 8 selfloop transitions, 2 changer transitions 1/93 dead transitions. [2025-04-30 10:29:14,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 213 flow [2025-04-30 10:29:14,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2025-04-30 10:29:14,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-04-30 10:29:14,365 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 197 flow. Second operand 3 states and 261 transitions. [2025-04-30 10:29:14,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 213 flow [2025-04-30 10:29:14,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 213 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:14,389 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 195 flow [2025-04-30 10:29:14,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-04-30 10:29:14,394 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 1 predicate places. [2025-04-30 10:29:14,394 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 195 flow [2025-04-30 10:29:14,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:14,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:14,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:29:14,395 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:29:14,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2073932816, now seen corresponding path program 1 times [2025-04-30 10:29:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:14,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120371147] [2025-04-30 10:29:14,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:14,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:29:14,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:29:14,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:14,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120371147] [2025-04-30 10:29:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120371147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436946060] [2025-04-30 10:29:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:14,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:14,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:14,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:14,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2025-04-30 10:29:14,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:14,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2025-04-30 10:29:14,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:14,510 INFO L116 PetriNetUnfolderBase]: 5/170 cut-off events. [2025-04-30 10:29:14,510 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:29:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 170 events. 5/170 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 334 event pairs, 2 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 165. Up to 16 conditions per place. [2025-04-30 10:29:14,512 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 7 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-04-30 10:29:14,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 213 flow [2025-04-30 10:29:14,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-04-30 10:29:14,515 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-30 10:29:14,515 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 195 flow. Second operand 3 states and 266 transitions. [2025-04-30 10:29:14,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 213 flow [2025-04-30 10:29:14,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:14,518 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 201 flow [2025-04-30 10:29:14,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-04-30 10:29:14,519 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-04-30 10:29:14,519 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 201 flow [2025-04-30 10:29:14,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:14,520 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] [2025-04-30 10:29:14,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:29:14,520 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:29:14,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -398974328, now seen corresponding path program 1 times [2025-04-30 10:29:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:14,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197116979] [2025-04-30 10:29:14,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:14,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:14,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:29:14,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:14,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:14,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:14,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197116979] [2025-04-30 10:29:14,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197116979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:14,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:14,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232443606] [2025-04-30 10:29:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:14,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:14,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:14,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:14,800 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 95 [2025-04-30 10:29:14,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:14,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 95 [2025-04-30 10:29:14,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:14,847 INFO L116 PetriNetUnfolderBase]: 2/148 cut-off events. [2025-04-30 10:29:14,847 INFO L117 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-04-30 10:29:14,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 148 events. 2/148 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 231 event pairs, 0 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 87. Up to 16 conditions per place. [2025-04-30 10:29:14,849 INFO L140 encePairwiseOnDemand]: 87/95 looper letters, 11 selfloop transitions, 2 changer transitions 5/97 dead transitions. [2025-04-30 10:29:14,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 247 flow [2025-04-30 10:29:14,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2025-04-30 10:29:14,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8859649122807017 [2025-04-30 10:29:14,851 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 201 flow. Second operand 6 states and 505 transitions. [2025-04-30 10:29:14,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 247 flow [2025-04-30 10:29:14,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:14,853 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 219 flow [2025-04-30 10:29:14,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2025-04-30 10:29:14,854 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2025-04-30 10:29:14,854 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 219 flow [2025-04-30 10:29:14,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:14,854 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] [2025-04-30 10:29:14,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:29:14,857 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:29:14,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1681749402, now seen corresponding path program 1 times [2025-04-30 10:29:14,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:14,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612259520] [2025-04-30 10:29:14,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:14,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:14,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:14,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:29:14,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:14,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:15,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612259520] [2025-04-30 10:29:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612259520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873089313] [2025-04-30 10:29:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:15,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:15,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:15,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:15,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 95 [2025-04-30 10:29:15,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:15,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:15,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 95 [2025-04-30 10:29:15,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:15,457 INFO L116 PetriNetUnfolderBase]: 71/371 cut-off events. [2025-04-30 10:29:15,457 INFO L117 PetriNetUnfolderBase]: For 26/29 co-relation queries the response was YES. [2025-04-30 10:29:15,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 371 events. 71/371 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1787 event pairs, 35 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 531. Up to 151 conditions per place. [2025-04-30 10:29:15,461 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 23 selfloop transitions, 22 changer transitions 0/113 dead transitions. [2025-04-30 10:29:15,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 113 transitions, 351 flow [2025-04-30 10:29:15,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-04-30 10:29:15,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8175438596491228 [2025-04-30 10:29:15,463 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 219 flow. Second operand 6 states and 466 transitions. [2025-04-30 10:29:15,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 113 transitions, 351 flow [2025-04-30 10:29:15,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 113 transitions, 337 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-30 10:29:15,466 INFO L231 Difference]: Finished difference. Result has 106 places, 113 transitions, 355 flow [2025-04-30 10:29:15,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=106, PETRI_TRANSITIONS=113} [2025-04-30 10:29:15,467 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2025-04-30 10:29:15,467 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 113 transitions, 355 flow [2025-04-30 10:29:15,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:15,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:15,468 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-04-30 10:29:15,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:29:15,468 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:29:15,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 802238143, now seen corresponding path program 1 times [2025-04-30 10:29:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:15,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376466723] [2025-04-30 10:29:15,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:15,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:29:15,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:29:15,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:15,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:15,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376466723] [2025-04-30 10:29:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376466723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:15,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:15,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798232120] [2025-04-30 10:29:15,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:15,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:15,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:15,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:15,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:15,801 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-04-30 10:29:15,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 113 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:15,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:15,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-04-30 10:29:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:15,911 INFO L116 PetriNetUnfolderBase]: 139/525 cut-off events. [2025-04-30 10:29:15,912 INFO L117 PetriNetUnfolderBase]: For 146/148 co-relation queries the response was YES. [2025-04-30 10:29:15,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 525 events. 139/525 cut-off events. For 146/148 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2739 event pairs, 31 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 1058. Up to 257 conditions per place. [2025-04-30 10:29:15,914 INFO L140 encePairwiseOnDemand]: 80/95 looper letters, 36 selfloop transitions, 48 changer transitions 12/156 dead transitions. [2025-04-30 10:29:15,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 679 flow [2025-04-30 10:29:15,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 492 transitions. [2025-04-30 10:29:15,917 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8631578947368421 [2025-04-30 10:29:15,918 INFO L175 Difference]: Start difference. First operand has 106 places, 113 transitions, 355 flow. Second operand 6 states and 492 transitions. [2025-04-30 10:29:15,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 679 flow [2025-04-30 10:29:15,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 156 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:15,924 INFO L231 Difference]: Finished difference. Result has 116 places, 144 transitions, 712 flow [2025-04-30 10:29:15,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=712, PETRI_PLACES=116, PETRI_TRANSITIONS=144} [2025-04-30 10:29:15,925 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2025-04-30 10:29:15,927 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 144 transitions, 712 flow [2025-04-30 10:29:15,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:15,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:15,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:15,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:29:15,927 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:29:15,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash -944832509, now seen corresponding path program 1 times [2025-04-30 10:29:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:15,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84037724] [2025-04-30 10:29:15,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:15,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:29:15,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:29:15,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:15,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84037724] [2025-04-30 10:29:16,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84037724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726385490] [2025-04-30 10:29:16,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:16,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:16,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:16,261 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-04-30 10:29:16,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 144 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-04-30 10:29:16,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:16,335 INFO L116 PetriNetUnfolderBase]: 142/515 cut-off events. [2025-04-30 10:29:16,335 INFO L117 PetriNetUnfolderBase]: For 444/450 co-relation queries the response was YES. [2025-04-30 10:29:16,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 515 events. 142/515 cut-off events. For 444/450 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2853 event pairs, 10 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1507. Up to 241 conditions per place. [2025-04-30 10:29:16,339 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 73 selfloop transitions, 25 changer transitions 13/172 dead transitions. [2025-04-30 10:29:16,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 172 transitions, 1095 flow [2025-04-30 10:29:16,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2025-04-30 10:29:16,342 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-04-30 10:29:16,342 INFO L175 Difference]: Start difference. First operand has 116 places, 144 transitions, 712 flow. Second operand 6 states and 475 transitions. [2025-04-30 10:29:16,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 172 transitions, 1095 flow [2025-04-30 10:29:16,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 172 transitions, 1076 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:16,352 INFO L231 Difference]: Finished difference. Result has 115 places, 159 transitions, 928 flow [2025-04-30 10:29:16,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=115, PETRI_TRANSITIONS=159} [2025-04-30 10:29:16,353 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2025-04-30 10:29:16,353 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 159 transitions, 928 flow [2025-04-30 10:29:16,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,354 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:16,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:29:16,354 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-30 10:29:16,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash -336358084, now seen corresponding path program 1 times [2025-04-30 10:29:16,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021257927] [2025-04-30 10:29:16,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:29:16,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:29:16,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:16,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:29:16,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:29:16,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-30 10:29:16,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:16,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:29:16,416 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:29:16,417 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-30 10:29:16,418 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-30 10:29:16,418 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-30 10:29:16,418 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-30 10:29:16,419 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-30 10:29:16,419 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-30 10:29:16,419 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-30 10:29:16,419 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-30 10:29:16,419 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-30 10:29:16,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:29:16,420 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:16,425 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:29:16,425 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:29:16,452 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:29:16,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 117 transitions, 250 flow [2025-04-30 10:29:16,466 INFO L116 PetriNetUnfolderBase]: 4/218 cut-off events. [2025-04-30 10:29:16,467 INFO L117 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-04-30 10:29:16,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 218 events. 4/218 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 488 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 130. Up to 6 conditions per place. [2025-04-30 10:29:16,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 117 transitions, 250 flow [2025-04-30 10:29:16,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 117 transitions, 250 flow [2025-04-30 10:29:16,468 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:16,469 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6fd60966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:16,469 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:29:16,470 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:16,470 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-30 10:29:16,470 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:16,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,470 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] [2025-04-30 10:29:16,470 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:16,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1434328419, now seen corresponding path program 1 times [2025-04-30 10:29:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955489988] [2025-04-30 10:29:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:29:16,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:29:16,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955489988] [2025-04-30 10:29:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955489988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918582444] [2025-04-30 10:29:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:16,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:16,507 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 117 [2025-04-30 10:29:16,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 117 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 117 [2025-04-30 10:29:16,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:16,564 INFO L116 PetriNetUnfolderBase]: 19/443 cut-off events. [2025-04-30 10:29:16,564 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-30 10:29:16,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 443 events. 19/443 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1838 event pairs, 16 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 289. Up to 50 conditions per place. [2025-04-30 10:29:16,566 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 11 selfloop transitions, 2 changer transitions 1/115 dead transitions. [2025-04-30 10:29:16,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 272 flow [2025-04-30 10:29:16,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2025-04-30 10:29:16,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2025-04-30 10:29:16,571 INFO L175 Difference]: Start difference. First operand has 119 places, 117 transitions, 250 flow. Second operand 3 states and 321 transitions. [2025-04-30 10:29:16,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 272 flow [2025-04-30 10:29:16,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:16,573 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 248 flow [2025-04-30 10:29:16,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2025-04-30 10:29:16,574 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2025-04-30 10:29:16,574 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 248 flow [2025-04-30 10:29:16,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:16,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:29:16,574 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:16,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 789972112, now seen corresponding path program 1 times [2025-04-30 10:29:16,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750471648] [2025-04-30 10:29:16,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:29:16,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:29:16,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:16,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750471648] [2025-04-30 10:29:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750471648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319862259] [2025-04-30 10:29:16,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:16,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:16,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 117 [2025-04-30 10:29:16,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 117 [2025-04-30 10:29:16,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:16,683 INFO L116 PetriNetUnfolderBase]: 48/635 cut-off events. [2025-04-30 10:29:16,683 INFO L117 PetriNetUnfolderBase]: For 45/50 co-relation queries the response was YES. [2025-04-30 10:29:16,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 635 events. 48/635 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3267 event pairs, 28 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 729. Up to 97 conditions per place. [2025-04-30 10:29:16,686 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 12 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-04-30 10:29:16,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 285 flow [2025-04-30 10:29:16,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-04-30 10:29:16,688 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-04-30 10:29:16,688 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 248 flow. Second operand 3 states and 324 transitions. [2025-04-30 10:29:16,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 285 flow [2025-04-30 10:29:16,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:16,690 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 259 flow [2025-04-30 10:29:16,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2025-04-30 10:29:16,691 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -2 predicate places. [2025-04-30 10:29:16,691 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 259 flow [2025-04-30 10:29:16,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,691 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] [2025-04-30 10:29:16,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:29:16,691 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:16,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1260371512, now seen corresponding path program 1 times [2025-04-30 10:29:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198189009] [2025-04-30 10:29:16,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:16,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:29:16,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198189009] [2025-04-30 10:29:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198189009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603056113] [2025-04-30 10:29:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:16,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:16,821 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 117 [2025-04-30 10:29:16,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 117 [2025-04-30 10:29:16,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:16,869 INFO L116 PetriNetUnfolderBase]: 12/351 cut-off events. [2025-04-30 10:29:16,870 INFO L117 PetriNetUnfolderBase]: For 30/57 co-relation queries the response was YES. [2025-04-30 10:29:16,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 351 events. 12/351 cut-off events. For 30/57 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1193 event pairs, 2 based on Foata normal form. 2/333 useless extension candidates. Maximal degree in co-relation 228. Up to 39 conditions per place. [2025-04-30 10:29:16,872 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 14 selfloop transitions, 2 changer transitions 5/120 dead transitions. [2025-04-30 10:29:16,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 313 flow [2025-04-30 10:29:16,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2025-04-30 10:29:16,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8945868945868946 [2025-04-30 10:29:16,873 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 259 flow. Second operand 6 states and 628 transitions. [2025-04-30 10:29:16,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 313 flow [2025-04-30 10:29:16,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 313 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:16,875 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 281 flow [2025-04-30 10:29:16,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2025-04-30 10:29:16,877 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2025-04-30 10:29:16,877 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 281 flow [2025-04-30 10:29:16,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:16,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,877 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] [2025-04-30 10:29:16,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:29:16,878 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:16,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1751820710, now seen corresponding path program 1 times [2025-04-30 10:29:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231291085] [2025-04-30 10:29:16,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:16,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:29:16,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:17,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231291085] [2025-04-30 10:29:17,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231291085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:17,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:17,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549930346] [2025-04-30 10:29:17,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:17,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:17,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:17,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:17,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:17,207 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2025-04-30 10:29:17,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:17,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:17,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2025-04-30 10:29:17,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:17,507 INFO L116 PetriNetUnfolderBase]: 1008/3080 cut-off events. [2025-04-30 10:29:17,507 INFO L117 PetriNetUnfolderBase]: For 206/210 co-relation queries the response was YES. [2025-04-30 10:29:17,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 3080 events. 1008/3080 cut-off events. For 206/210 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 24935 event pairs, 569 based on Foata normal form. 0/2792 useless extension candidates. Maximal degree in co-relation 4551. Up to 1570 conditions per place. [2025-04-30 10:29:17,525 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 31 selfloop transitions, 38 changer transitions 0/153 dead transitions. [2025-04-30 10:29:17,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 153 transitions, 500 flow [2025-04-30 10:29:17,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2025-04-30 10:29:17,526 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-04-30 10:29:17,527 INFO L175 Difference]: Start difference. First operand has 126 places, 115 transitions, 281 flow. Second operand 6 states and 585 transitions. [2025-04-30 10:29:17,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 153 transitions, 500 flow [2025-04-30 10:29:17,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 153 transitions, 488 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:17,530 INFO L231 Difference]: Finished difference. Result has 129 places, 152 transitions, 523 flow [2025-04-30 10:29:17,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=129, PETRI_TRANSITIONS=152} [2025-04-30 10:29:17,530 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2025-04-30 10:29:17,530 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 152 transitions, 523 flow [2025-04-30 10:29:17,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:17,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:17,531 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-04-30 10:29:17,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:29:17,531 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:17,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1311285928, now seen corresponding path program 1 times [2025-04-30 10:29:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:17,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106331068] [2025-04-30 10:29:17,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:17,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:29:17,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:29:17,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:17,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:17,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106331068] [2025-04-30 10:29:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106331068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:17,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469291088] [2025-04-30 10:29:17,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:17,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:17,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:17,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:17,816 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-04-30 10:29:17,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 152 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:17,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:17,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-04-30 10:29:17,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:18,495 INFO L116 PetriNetUnfolderBase]: 2550/7162 cut-off events. [2025-04-30 10:29:18,496 INFO L117 PetriNetUnfolderBase]: For 1957/2591 co-relation queries the response was YES. [2025-04-30 10:29:18,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15511 conditions, 7162 events. 2550/7162 cut-off events. For 1957/2591 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 65737 event pairs, 638 based on Foata normal form. 22/6588 useless extension candidates. Maximal degree in co-relation 13018. Up to 3080 conditions per place. [2025-04-30 10:29:18,538 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 87 selfloop transitions, 86 changer transitions 0/262 dead transitions. [2025-04-30 10:29:18,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 262 transitions, 1353 flow [2025-04-30 10:29:18,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2025-04-30 10:29:18,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-04-30 10:29:18,540 INFO L175 Difference]: Start difference. First operand has 129 places, 152 transitions, 523 flow. Second operand 6 states and 630 transitions. [2025-04-30 10:29:18,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 262 transitions, 1353 flow [2025-04-30 10:29:18,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 262 transitions, 1353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:18,554 INFO L231 Difference]: Finished difference. Result has 138 places, 235 transitions, 1249 flow [2025-04-30 10:29:18,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1249, PETRI_PLACES=138, PETRI_TRANSITIONS=235} [2025-04-30 10:29:18,556 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2025-04-30 10:29:18,556 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 235 transitions, 1249 flow [2025-04-30 10:29:18,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:18,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:18,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:18,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:29:18,556 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:18,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1376179124, now seen corresponding path program 1 times [2025-04-30 10:29:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:18,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444354339] [2025-04-30 10:29:18,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:18,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:18,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:29:18,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:29:18,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:18,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:18,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-04-30 10:29:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:18,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444354339] [2025-04-30 10:29:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444354339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:18,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:18,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402596250] [2025-04-30 10:29:18,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:18,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:18,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:18,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:18,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-04-30 10:29:18,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 235 transitions, 1249 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:18,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:18,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-04-30 10:29:18,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:19,742 INFO L116 PetriNetUnfolderBase]: 3068/8919 cut-off events. [2025-04-30 10:29:19,742 INFO L117 PetriNetUnfolderBase]: For 7036/7427 co-relation queries the response was YES. [2025-04-30 10:29:19,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24687 conditions, 8919 events. 3068/8919 cut-off events. For 7036/7427 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 89014 event pairs, 530 based on Foata normal form. 30/8361 useless extension candidates. Maximal degree in co-relation 23714. Up to 4185 conditions per place. [2025-04-30 10:29:19,813 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 135 selfloop transitions, 71 changer transitions 0/303 dead transitions. [2025-04-30 10:29:19,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 303 transitions, 2105 flow [2025-04-30 10:29:19,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2025-04-30 10:29:19,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8490028490028491 [2025-04-30 10:29:19,816 INFO L175 Difference]: Start difference. First operand has 138 places, 235 transitions, 1249 flow. Second operand 6 states and 596 transitions. [2025-04-30 10:29:19,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 303 transitions, 2105 flow [2025-04-30 10:29:19,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 303 transitions, 2087 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:19,843 INFO L231 Difference]: Finished difference. Result has 148 places, 301 transitions, 2011 flow [2025-04-30 10:29:19,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2011, PETRI_PLACES=148, PETRI_TRANSITIONS=301} [2025-04-30 10:29:19,843 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2025-04-30 10:29:19,844 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 301 transitions, 2011 flow [2025-04-30 10:29:19,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:19,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:19,844 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:19,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:29:19,844 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:19,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash 916265989, now seen corresponding path program 1 times [2025-04-30 10:29:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:19,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268585027] [2025-04-30 10:29:19,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:19,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:29:19,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:29:19,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:19,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:20,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268585027] [2025-04-30 10:29:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268585027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:20,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:20,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2603707] [2025-04-30 10:29:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:20,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:20,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:20,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:20,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:20,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2025-04-30 10:29:20,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 301 transitions, 2011 flow. Second operand has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:20,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:20,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2025-04-30 10:29:20,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:21,681 INFO L116 PetriNetUnfolderBase]: 3384/9654 cut-off events. [2025-04-30 10:29:21,681 INFO L117 PetriNetUnfolderBase]: For 13373/14032 co-relation queries the response was YES. [2025-04-30 10:29:21,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30640 conditions, 9654 events. 3384/9654 cut-off events. For 13373/14032 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 96686 event pairs, 480 based on Foata normal form. 148/9227 useless extension candidates. Maximal degree in co-relation 29367. Up to 3017 conditions per place. [2025-04-30 10:29:21,751 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 310 selfloop transitions, 36 changer transitions 0/432 dead transitions. [2025-04-30 10:29:21,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 432 transitions, 3905 flow [2025-04-30 10:29:21,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:29:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:29:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1100 transitions. [2025-04-30 10:29:21,754 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7232084155161078 [2025-04-30 10:29:21,754 INFO L175 Difference]: Start difference. First operand has 148 places, 301 transitions, 2011 flow. Second operand 13 states and 1100 transitions. [2025-04-30 10:29:21,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 432 transitions, 3905 flow [2025-04-30 10:29:21,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 432 transitions, 3765 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:21,797 INFO L231 Difference]: Finished difference. Result has 159 places, 300 transitions, 1939 flow [2025-04-30 10:29:21,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1939, PETRI_PLACES=159, PETRI_TRANSITIONS=300} [2025-04-30 10:29:21,798 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2025-04-30 10:29:21,798 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 300 transitions, 1939 flow [2025-04-30 10:29:21,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:21,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:21,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:21,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:29:21,798 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:21,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1223994906, now seen corresponding path program 1 times [2025-04-30 10:29:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:21,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125588115] [2025-04-30 10:29:21,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:21,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:29:21,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:29:21,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:21,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:22,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:22,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125588115] [2025-04-30 10:29:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125588115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118436067] [2025-04-30 10:29:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:22,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:22,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:22,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:22,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:22,569 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 117 [2025-04-30 10:29:22,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 300 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:22,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:22,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 117 [2025-04-30 10:29:22,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:24,196 INFO L116 PetriNetUnfolderBase]: 5301/13430 cut-off events. [2025-04-30 10:29:24,196 INFO L117 PetriNetUnfolderBase]: For 18999/22288 co-relation queries the response was YES. [2025-04-30 10:29:24,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45102 conditions, 13430 events. 5301/13430 cut-off events. For 18999/22288 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 132411 event pairs, 730 based on Foata normal form. 397/13256 useless extension candidates. Maximal degree in co-relation 41092. Up to 3237 conditions per place. [2025-04-30 10:29:24,279 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 342 selfloop transitions, 262 changer transitions 6/691 dead transitions. [2025-04-30 10:29:24,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 691 transitions, 6043 flow [2025-04-30 10:29:24,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:29:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-30 10:29:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1614 transitions. [2025-04-30 10:29:24,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7663817663817664 [2025-04-30 10:29:24,282 INFO L175 Difference]: Start difference. First operand has 159 places, 300 transitions, 1939 flow. Second operand 18 states and 1614 transitions. [2025-04-30 10:29:24,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 691 transitions, 6043 flow [2025-04-30 10:29:24,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 691 transitions, 5899 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-30 10:29:24,345 INFO L231 Difference]: Finished difference. Result has 174 places, 506 transitions, 4575 flow [2025-04-30 10:29:24,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4575, PETRI_PLACES=174, PETRI_TRANSITIONS=506} [2025-04-30 10:29:24,346 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2025-04-30 10:29:24,346 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 506 transitions, 4575 flow [2025-04-30 10:29:24,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:24,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:24,346 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-04-30 10:29:24,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:29:24,347 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:24,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1525730033, now seen corresponding path program 1 times [2025-04-30 10:29:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:24,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886976444] [2025-04-30 10:29:24,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:24,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:29:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:29:24,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:24,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:24,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:24,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886976444] [2025-04-30 10:29:24,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886976444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:24,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:24,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:24,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549961366] [2025-04-30 10:29:24,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:24,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:24,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:24,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:25,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 117 [2025-04-30 10:29:25,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 506 transitions, 4575 flow. Second operand has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:25,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:25,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 117 [2025-04-30 10:29:25,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:26,664 INFO L116 PetriNetUnfolderBase]: 4490/12084 cut-off events. [2025-04-30 10:29:26,665 INFO L117 PetriNetUnfolderBase]: For 34889/35908 co-relation queries the response was YES. [2025-04-30 10:29:26,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48108 conditions, 12084 events. 4490/12084 cut-off events. For 34889/35908 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 121738 event pairs, 445 based on Foata normal form. 264/11767 useless extension candidates. Maximal degree in co-relation 46729. Up to 3248 conditions per place. [2025-04-30 10:29:26,752 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 495 selfloop transitions, 44 changer transitions 0/658 dead transitions. [2025-04-30 10:29:26,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 658 transitions, 7538 flow [2025-04-30 10:29:26,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:29:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:29:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1124 transitions. [2025-04-30 10:29:26,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7389875082182774 [2025-04-30 10:29:26,755 INFO L175 Difference]: Start difference. First operand has 174 places, 506 transitions, 4575 flow. Second operand 13 states and 1124 transitions. [2025-04-30 10:29:26,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 658 transitions, 7538 flow [2025-04-30 10:29:26,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 658 transitions, 7460 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-04-30 10:29:26,913 INFO L231 Difference]: Finished difference. Result has 180 places, 505 transitions, 4589 flow [2025-04-30 10:29:26,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4589, PETRI_PLACES=180, PETRI_TRANSITIONS=505} [2025-04-30 10:29:26,914 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2025-04-30 10:29:26,914 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 505 transitions, 4589 flow [2025-04-30 10:29:26,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:26,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:26,915 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:26,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:29:26,915 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:26,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1859306651, now seen corresponding path program 1 times [2025-04-30 10:29:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:26,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641077593] [2025-04-30 10:29:26,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:26,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:29:26,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:29:26,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:26,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:29:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:27,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641077593] [2025-04-30 10:29:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641077593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658376051] [2025-04-30 10:29:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:27,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:27,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:27,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:27,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-04-30 10:29:27,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 505 transitions, 4589 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:27,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:27,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-04-30 10:29:27,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:28,197 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([349] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread2of2ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} AuxVars[] AssignedVars[#race][333], [30#L1023-11true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 161#true, Black: 199#true, Black: 219#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 131#(= |ULTIMATE.start_main_~i~1#1| 0), 118#true, Black: 156#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 265#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 143#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 206#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 96#L1037-1true, Black: 125#true, Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 225#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 205#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 204#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 207#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 120#true, Black: 209#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 37#L1023-7true, Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 151#true, Black: 223#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 142#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 163#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 208#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 140#true, 241#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 155#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 221#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 127#(= |#race~datas~0| 0)]) [2025-04-30 10:29:28,198 INFO L286 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2025-04-30 10:29:28,198 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:29:28,198 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:29:28,198 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:29:29,792 INFO L116 PetriNetUnfolderBase]: 9977/22482 cut-off events. [2025-04-30 10:29:29,793 INFO L117 PetriNetUnfolderBase]: For 76640/77811 co-relation queries the response was YES. [2025-04-30 10:29:29,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91924 conditions, 22482 events. 9977/22482 cut-off events. For 76640/77811 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 228773 event pairs, 1239 based on Foata normal form. 11/21301 useless extension candidates. Maximal degree in co-relation 89860. Up to 11546 conditions per place. [2025-04-30 10:29:30,018 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 363 selfloop transitions, 352 changer transitions 15/862 dead transitions. [2025-04-30 10:29:30,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 862 transitions, 9423 flow [2025-04-30 10:29:30,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2025-04-30 10:29:30,020 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8917378917378918 [2025-04-30 10:29:30,020 INFO L175 Difference]: Start difference. First operand has 180 places, 505 transitions, 4589 flow. Second operand 6 states and 626 transitions. [2025-04-30 10:29:30,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 862 transitions, 9423 flow [2025-04-30 10:29:30,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 862 transitions, 9187 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-30 10:29:30,453 INFO L231 Difference]: Finished difference. Result has 177 places, 777 transitions, 8304 flow [2025-04-30 10:29:30,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8304, PETRI_PLACES=177, PETRI_TRANSITIONS=777} [2025-04-30 10:29:30,454 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 58 predicate places. [2025-04-30 10:29:30,454 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 777 transitions, 8304 flow [2025-04-30 10:29:30,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:30,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,454 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:30,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:29:30,454 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-30 10:29:30,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1070442047, now seen corresponding path program 1 times [2025-04-30 10:29:30,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134412902] [2025-04-30 10:29:30,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:29:30,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:29:30,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:30,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:29:30,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:29:30,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:29:30,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:30,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:29:30,483 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-30 10:29:30,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-30 10:29:30,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:29:30,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:30,484 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:29:30,484 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:29:30,507 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-30 10:29:30,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 139 transitions, 305 flow [2025-04-30 10:29:30,530 INFO L116 PetriNetUnfolderBase]: 9/359 cut-off events. [2025-04-30 10:29:30,530 INFO L117 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-04-30 10:29:30,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 359 events. 9/359 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1033 event pairs, 1 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 226. Up to 12 conditions per place. [2025-04-30 10:29:30,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 139 transitions, 305 flow [2025-04-30 10:29:30,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 139 transitions, 305 flow [2025-04-30 10:29:30,535 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:30,535 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6fd60966, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:30,535 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:29:30,536 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:30,537 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-30 10:29:30,537 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:30,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,537 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] [2025-04-30 10:29:30,537 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-30 10:29:30,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,537 INFO L85 PathProgramCache]: Analyzing trace with hash 551201486, now seen corresponding path program 1 times [2025-04-30 10:29:30,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608660570] [2025-04-30 10:29:30,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:29:30,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:29:30,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:30,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608660570] [2025-04-30 10:29:30,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608660570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:30,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:30,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150943313] [2025-04-30 10:29:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:30,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:30,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:30,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:30,568 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2025-04-30 10:29:30,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:30,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:30,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2025-04-30 10:29:30,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:30,645 INFO L116 PetriNetUnfolderBase]: 90/1263 cut-off events. [2025-04-30 10:29:30,645 INFO L117 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-04-30 10:29:30,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1263 events. 90/1263 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8361 event pairs, 81 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 880. Up to 178 conditions per place. [2025-04-30 10:29:30,650 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 14 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2025-04-30 10:29:30,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 333 flow [2025-04-30 10:29:30,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2025-04-30 10:29:30,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9136690647482014 [2025-04-30 10:29:30,653 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 305 flow. Second operand 3 states and 381 transitions. [2025-04-30 10:29:30,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 333 flow [2025-04-30 10:29:30,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:30,656 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 303 flow [2025-04-30 10:29:30,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2025-04-30 10:29:30,656 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2025-04-30 10:29:30,656 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 303 flow [2025-04-30 10:29:30,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:30,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:30,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:29:30,657 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-30 10:29:30,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash 337931248, now seen corresponding path program 1 times [2025-04-30 10:29:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20880968] [2025-04-30 10:29:30,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:29:30,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:29:30,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:30,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20880968] [2025-04-30 10:29:30,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20880968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:30,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:30,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:30,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829155939] [2025-04-30 10:29:30,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:30,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:30,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:30,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:30,685 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 139 [2025-04-30 10:29:30,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:30,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:30,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 139 [2025-04-30 10:29:30,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:30,818 INFO L116 PetriNetUnfolderBase]: 307/2366 cut-off events. [2025-04-30 10:29:30,819 INFO L117 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-04-30 10:29:30,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 2366 events. 307/2366 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 19110 event pairs, 207 based on Foata normal form. 0/2153 useless extension candidates. Maximal degree in co-relation 2954. Up to 508 conditions per place. [2025-04-30 10:29:30,830 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 17 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-04-30 10:29:30,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 361 flow [2025-04-30 10:29:30,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-04-30 10:29:30,831 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9160671462829736 [2025-04-30 10:29:30,831 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 303 flow. Second operand 3 states and 382 transitions. [2025-04-30 10:29:30,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 361 flow [2025-04-30 10:29:30,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:30,833 INFO L231 Difference]: Finished difference. Result has 139 places, 136 transitions, 319 flow [2025-04-30 10:29:30,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=139, PETRI_TRANSITIONS=136} [2025-04-30 10:29:30,834 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -3 predicate places. [2025-04-30 10:29:30,834 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 136 transitions, 319 flow [2025-04-30 10:29:30,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:30,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,835 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] [2025-04-30 10:29:30,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:29:30,835 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-30 10:29:30,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1879940472, now seen corresponding path program 1 times [2025-04-30 10:29:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699007297] [2025-04-30 10:29:30,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:30,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:29:30,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:30,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699007297] [2025-04-30 10:29:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699007297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533406374] [2025-04-30 10:29:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:30,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:30,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:30,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:30,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:30,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2025-04-30 10:29:30,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:30,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:30,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2025-04-30 10:29:30,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:30,995 INFO L116 PetriNetUnfolderBase]: 50/857 cut-off events. [2025-04-30 10:29:30,995 INFO L117 PetriNetUnfolderBase]: For 83/132 co-relation queries the response was YES. [2025-04-30 10:29:30,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 857 events. 50/857 cut-off events. For 83/132 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4702 event pairs, 17 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 603. Up to 98 conditions per place. [2025-04-30 10:29:30,999 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 16 selfloop transitions, 2 changer transitions 5/142 dead transitions. [2025-04-30 10:29:30,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 142 transitions, 377 flow [2025-04-30 10:29:30,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2025-04-30 10:29:31,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8992805755395683 [2025-04-30 10:29:31,000 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 319 flow. Second operand 6 states and 750 transitions. [2025-04-30 10:29:31,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 142 transitions, 377 flow [2025-04-30 10:29:31,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 377 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:31,002 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 341 flow [2025-04-30 10:29:31,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2025-04-30 10:29:31,002 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2025-04-30 10:29:31,002 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 341 flow [2025-04-30 10:29:31,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:31,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:31,002 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] [2025-04-30 10:29:31,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:29:31,003 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-30 10:29:31,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1132251750, now seen corresponding path program 1 times [2025-04-30 10:29:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:31,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143300080] [2025-04-30 10:29:31,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:31,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:31,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:29:31,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:31,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:31,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:31,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143300080] [2025-04-30 10:29:31,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143300080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:31,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:31,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380437665] [2025-04-30 10:29:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:31,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:31,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:31,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:31,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:31,212 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 139 [2025-04-30 10:29:31,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:31,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:31,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 139 [2025-04-30 10:29:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:33,222 INFO L116 PetriNetUnfolderBase]: 10319/23676 cut-off events. [2025-04-30 10:29:33,222 INFO L117 PetriNetUnfolderBase]: For 2022/2078 co-relation queries the response was YES. [2025-04-30 10:29:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40691 conditions, 23676 events. 10319/23676 cut-off events. For 2022/2078 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 240256 event pairs, 6820 based on Foata normal form. 0/21705 useless extension candidates. Maximal degree in co-relation 35539. Up to 14041 conditions per place. [2025-04-30 10:29:33,389 INFO L140 encePairwiseOnDemand]: 120/139 looper letters, 38 selfloop transitions, 54 changer transitions 0/192 dead transitions. [2025-04-30 10:29:33,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 192 transitions, 647 flow [2025-04-30 10:29:33,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2025-04-30 10:29:33,391 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8441247002398081 [2025-04-30 10:29:33,391 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 341 flow. Second operand 6 states and 704 transitions. [2025-04-30 10:29:33,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 192 transitions, 647 flow [2025-04-30 10:29:33,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 192 transitions, 635 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:33,398 INFO L231 Difference]: Finished difference. Result has 151 places, 190 transitions, 687 flow [2025-04-30 10:29:33,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=151, PETRI_TRANSITIONS=190} [2025-04-30 10:29:33,398 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2025-04-30 10:29:33,398 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 190 transitions, 687 flow [2025-04-30 10:29:33,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:33,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:33,399 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-04-30 10:29:33,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:29:33,399 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-30 10:29:33,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1817480423, now seen corresponding path program 1 times [2025-04-30 10:29:33,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:33,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032747709] [2025-04-30 10:29:33,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:33,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:29:33,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:29:33,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:33,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:33,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:33,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032747709] [2025-04-30 10:29:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032747709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:33,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:33,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690144674] [2025-04-30 10:29:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:33,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:33,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:33,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:33,686 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2025-04-30 10:29:33,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 190 transitions, 687 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:33,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:33,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2025-04-30 10:29:33,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:36,310 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 37#L1023-7true, 137#L1023-11true, 100#L1032-9true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 119#L1023-7true, 150#(= |#race~datas~0| 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 163#true]) [2025-04-30 10:29:36,310 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-30 10:29:36,310 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:36,310 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:36,310 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:36,480 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, 9#L1023-8true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 37#L1023-7true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 137#L1023-11true, 100#L1032-9true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 163#true]) [2025-04-30 10:29:36,480 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-30 10:29:36,480 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:29:36,480 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:29:36,480 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:29:36,608 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 37#L1023-7true, 137#L1023-11true, 100#L1032-9true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), 65#L1023-9true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 163#true]) [2025-04-30 10:29:36,608 INFO L286 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-04-30 10:29:36,608 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-30 10:29:36,608 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-30 10:29:36,608 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-30 10:29:36,735 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 37#L1023-7true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 137#L1023-11true, 100#L1032-9true, Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 174#true, 150#(= |#race~datas~0| 0), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 68#L1023-10true, 163#true]) [2025-04-30 10:29:36,735 INFO L286 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-04-30 10:29:36,735 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-30 10:29:36,735 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-30 10:29:36,735 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-30 10:29:39,195 INFO L116 PetriNetUnfolderBase]: 30375/69952 cut-off events. [2025-04-30 10:29:39,195 INFO L117 PetriNetUnfolderBase]: For 20526/26311 co-relation queries the response was YES. [2025-04-30 10:29:39,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156788 conditions, 69952 events. 30375/69952 cut-off events. For 20526/26311 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 807086 event pairs, 7860 based on Foata normal form. 109/64395 useless extension candidates. Maximal degree in co-relation 128417. Up to 30576 conditions per place. [2025-04-30 10:29:39,593 INFO L140 encePairwiseOnDemand]: 116/139 looper letters, 129 selfloop transitions, 118 changer transitions 0/352 dead transitions. [2025-04-30 10:29:39,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 352 transitions, 1953 flow [2025-04-30 10:29:39,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2025-04-30 10:29:39,594 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9064748201438849 [2025-04-30 10:29:39,594 INFO L175 Difference]: Start difference. First operand has 151 places, 190 transitions, 687 flow. Second operand 6 states and 756 transitions. [2025-04-30 10:29:39,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 352 transitions, 1953 flow [2025-04-30 10:29:39,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 352 transitions, 1953 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:39,667 INFO L231 Difference]: Finished difference. Result has 160 places, 307 transitions, 1760 flow [2025-04-30 10:29:39,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1760, PETRI_PLACES=160, PETRI_TRANSITIONS=307} [2025-04-30 10:29:39,668 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 18 predicate places. [2025-04-30 10:29:39,668 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 307 transitions, 1760 flow [2025-04-30 10:29:39,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:39,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:39,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:39,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:29:39,668 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-30 10:29:39,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2058981077, now seen corresponding path program 1 times [2025-04-30 10:29:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:39,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405043025] [2025-04-30 10:29:39,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:39,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:29:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-30 10:29:39,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:39,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:39,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405043025] [2025-04-30 10:29:39,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405043025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:39,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:39,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685394312] [2025-04-30 10:29:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:39,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:39,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:39,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:39,886 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2025-04-30 10:29:39,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 307 transitions, 1760 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:39,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:39,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2025-04-30 10:29:39,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:48,374 INFO L116 PetriNetUnfolderBase]: 35347/83309 cut-off events. [2025-04-30 10:29:48,375 INFO L117 PetriNetUnfolderBase]: For 75076/80579 co-relation queries the response was YES. [2025-04-30 10:29:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242769 conditions, 83309 events. 35347/83309 cut-off events. For 75076/80579 co-relation queries the response was YES. Maximal size of possible extension queue 2607. Compared 1011255 event pairs, 8916 based on Foata normal form. 242/77759 useless extension candidates. Maximal degree in co-relation 232820. Up to 43550 conditions per place. [2025-04-30 10:29:49,035 INFO L140 encePairwiseOnDemand]: 120/139 looper letters, 192 selfloop transitions, 110 changer transitions 0/415 dead transitions. [2025-04-30 10:29:49,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 415 transitions, 3092 flow [2025-04-30 10:29:49,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2025-04-30 10:29:49,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8573141486810552 [2025-04-30 10:29:49,037 INFO L175 Difference]: Start difference. First operand has 160 places, 307 transitions, 1760 flow. Second operand 6 states and 715 transitions. [2025-04-30 10:29:49,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 415 transitions, 3092 flow [2025-04-30 10:29:49,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 415 transitions, 3074 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:49,571 INFO L231 Difference]: Finished difference. Result has 170 places, 412 transitions, 2987 flow [2025-04-30 10:29:49,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2987, PETRI_PLACES=170, PETRI_TRANSITIONS=412} [2025-04-30 10:29:49,572 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 28 predicate places. [2025-04-30 10:29:49,572 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 412 transitions, 2987 flow [2025-04-30 10:29:49,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:49,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:49,572 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:49,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:29:49,573 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-30 10:29:49,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1714367630, now seen corresponding path program 1 times [2025-04-30 10:29:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:49,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307442490] [2025-04-30 10:29:49,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:49,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:49,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:29:49,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:29:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:49,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:49,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307442490] [2025-04-30 10:29:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307442490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:49,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:49,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327258752] [2025-04-30 10:29:49,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:49,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:49,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:49,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:50,075 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 139 [2025-04-30 10:29:50,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 412 transitions, 2987 flow. Second operand has 11 states, 11 states have (on average 96.18181818181819) internal successors, (1058), 11 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:50,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:50,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 139 [2025-04-30 10:29:50,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:55,377 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][380], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 174#true, Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 68#L1023-10true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 37#L1023-7true, Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 27#L1023-10true, 143#true, 141#true, 76#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 184#true, 163#true]) [2025-04-30 10:29:55,377 INFO L286 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-04-30 10:29:55,377 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-30 10:29:55,377 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-30 10:29:55,377 INFO L289 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-04-30 10:29:56,852 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][380], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 174#true, 65#L1023-9true, Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 37#L1023-7true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 27#L1023-10true, 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 76#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true, 163#true]) [2025-04-30 10:29:56,852 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-30 10:29:56,852 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:29:56,852 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:29:56,852 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:29:57,603 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][387], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 137#L1023-11true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 174#true, Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 68#L1023-10true, 37#L1023-7true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 143#true, 141#true, 76#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 184#true, 163#true]) [2025-04-30 10:29:57,604 INFO L286 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-04-30 10:29:57,604 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-30 10:29:57,604 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-30 10:29:57,604 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-04-30 10:29:57,893 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][380], [139#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 131#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 174#true, Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 68#L1023-10true, 37#L1023-7true, Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 148#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 143#true, 141#true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 76#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true, 163#true]) [2025-04-30 10:29:57,893 INFO L286 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-04-30 10:29:57,893 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-04-30 10:29:57,893 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-04-30 10:29:57,893 INFO L289 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event