./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race-2.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-2.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 b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:29:10,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:29:10,180 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,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:29:10,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:29:10,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:29:10,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:29:10,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:29:10,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:29:10,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:29:10,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:29:10,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:29:10,205 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:29:10,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:29:10,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:29:10,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:29:10,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:29:10,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:29:10,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:10,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:10,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:10,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:29:10,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:29:10,207 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 -> b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 [2025-04-30 10:29:10,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:29:10,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:29:10,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:29:10,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:29:10,451 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:29:10,452 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-2.i [2025-04-30 10:29:11,750 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c88cc47/7266acaa9f964af6bbbe164e5c2450d1/FLAGd296a237f [2025-04-30 10:29:12,003 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:29:12,005 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race-2.i [2025-04-30 10:29:12,019 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c88cc47/7266acaa9f964af6bbbe164e5c2450d1/FLAGd296a237f [2025-04-30 10:29:12,751 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c88cc47/7266acaa9f964af6bbbe164e5c2450d1 [2025-04-30 10:29:12,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:29:12,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:29:12,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:12,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:29:12,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:29:12,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:12" (1/1) ... [2025-04-30 10:29:12,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747ff0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:12, skipping insertion in model container [2025-04-30 10:29:12,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:12" (1/1) ... [2025-04-30 10:29:12,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:29:13,117 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:13,124 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:29:13,177 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:13,212 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:29:13,213 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,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:13,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:13,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:29:13,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:29:13,218 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,230 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,244 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-04-30 10:29:13,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:13,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:29:13,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:29:13,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:29:13,250 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,250 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,253 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,253 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,258 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,258 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,264 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,265 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,266 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,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:29:13,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:29:13,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:29:13,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:29:13,277 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,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:13,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:29:13,301 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,305 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,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:29:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:29:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:29:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:29:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:29:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:29:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:29:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:29:13,322 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,416 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:29:13,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:29:13,555 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:29:13,556 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:29:13,563 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:29:13,563 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:29:13,564 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,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:29:13,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:29:13,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:29:13,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:29:13,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:29:12" (1/3) ... [2025-04-30 10:29:13,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a717f7d 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,569 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,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a717f7d 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,569 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,570 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i [2025-04-30 10:29:13,580 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:29:13,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index-race-2.i that has 2 procedures, 92 locations, 93 edges, 1 initial locations, 2 loop locations, and 6 error locations. [2025-04-30 10:29:13,582 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:29:13,639 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:29:13,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 94 transitions, 195 flow [2025-04-30 10:29:13,722 INFO L116 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-04-30 10:29:13,724 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:29:13,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 2/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 224 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-04-30 10:29:13,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 94 transitions, 195 flow [2025-04-30 10:29:13,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 94 transitions, 195 flow [2025-04-30 10:29:13,733 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:13,742 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;@9e91a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:13,743 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-30 10:29:13,748 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:13,748 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-30 10:29:13,748 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:13,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:13,749 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:13,749 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:13,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1619011899, now seen corresponding path program 1 times [2025-04-30 10:29:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:13,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928154105] [2025-04-30 10:29:13,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:13,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:29:13,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:29:13,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:13,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:13,927 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:13,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:13,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928154105] [2025-04-30 10:29:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928154105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:13,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:13,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873168196] [2025-04-30 10:29:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:13,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:13,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:13,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:13,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2025-04-30 10:29:13,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:13,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:13,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2025-04-30 10:29:13,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:14,034 INFO L116 PetriNetUnfolderBase]: 3/161 cut-off events. [2025-04-30 10:29:14,035 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:29:14,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 161 events. 3/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 333 event pairs, 2 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 101. Up to 15 conditions per place. [2025-04-30 10:29:14,036 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-04-30 10:29:14,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2025-04-30 10:29:14,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-04-30 10:29:14,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9148936170212766 [2025-04-30 10:29:14,048 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 195 flow. Second operand 3 states and 258 transitions. [2025-04-30 10:29:14,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2025-04-30 10:29:14,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:14,059 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2025-04-30 10:29:14,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=94, 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=3, PETRI_FLOW=193, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-04-30 10:29:14,084 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-04-30 10:29:14,084 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2025-04-30 10:29:14,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:14,085 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,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:29:14,085 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,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1731049595, now seen corresponding path program 1 times [2025-04-30 10:29:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:14,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498670857] [2025-04-30 10:29:14,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:14,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:29:14,109 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,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:14,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:14,145 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,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:14,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498670857] [2025-04-30 10:29:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498670857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:14,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:14,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237770659] [2025-04-30 10:29:14,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:14,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:14,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:14,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:14,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2025-04-30 10:29:14,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:14,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2025-04-30 10:29:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:14,194 INFO L116 PetriNetUnfolderBase]: 5/169 cut-off events. [2025-04-30 10:29:14,195 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:29:14,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 169 events. 5/169 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 337 event pairs, 2 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2025-04-30 10:29:14,196 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-04-30 10:29:14,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2025-04-30 10:29:14,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-04-30 10:29:14,198 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2025-04-30 10:29:14,198 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2025-04-30 10:29:14,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2025-04-30 10:29:14,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:14,200 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2025-04-30 10:29:14,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2025-04-30 10:29:14,203 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2025-04-30 10:29:14,203 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2025-04-30 10:29:14,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:29:14,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:14,203 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,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:29:14,203 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,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -342989944, now seen corresponding path program 1 times [2025-04-30 10:29:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:14,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885666276] [2025-04-30 10:29:14,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:14,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:14,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:14,236 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,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:14,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:14,351 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,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:14,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885666276] [2025-04-30 10:29:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885666276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:14,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:14,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272205184] [2025-04-30 10:29:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:14,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:14,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:14,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:14,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2025-04-30 10:29:14,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:14,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2025-04-30 10:29:14,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:14,478 INFO L116 PetriNetUnfolderBase]: 2/147 cut-off events. [2025-04-30 10:29:14,478 INFO L117 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-04-30 10:29:14,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 147 events. 2/147 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 239 event pairs, 0 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 86. Up to 16 conditions per place. [2025-04-30 10:29:14,480 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 11 selfloop transitions, 2 changer transitions 5/96 dead transitions. [2025-04-30 10:29:14,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 245 flow [2025-04-30 10:29:14,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2025-04-30 10:29:14,484 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8847517730496454 [2025-04-30 10:29:14,484 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 499 transitions. [2025-04-30 10:29:14,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 245 flow [2025-04-30 10:29:14,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:14,487 INFO L231 Difference]: Finished difference. Result has 103 places, 91 transitions, 217 flow [2025-04-30 10:29:14,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=103, PETRI_TRANSITIONS=91} [2025-04-30 10:29:14,488 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 8 predicate places. [2025-04-30 10:29:14,488 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 91 transitions, 217 flow [2025-04-30 10:29:14,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:14,489 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,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:29:14,490 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,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 323087230, now seen corresponding path program 1 times [2025-04-30 10:29:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:14,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644074327] [2025-04-30 10:29:14,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:14,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:14,517 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,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:14,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:14,852 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,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:14,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644074327] [2025-04-30 10:29:14,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644074327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:14,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:14,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:14,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718827881] [2025-04-30 10:29:14,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:14,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:14,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:14,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:14,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:14,965 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 94 [2025-04-30 10:29:14,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 91 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:14,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 94 [2025-04-30 10:29:14,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:15,053 INFO L116 PetriNetUnfolderBase]: 71/370 cut-off events. [2025-04-30 10:29:15,053 INFO L117 PetriNetUnfolderBase]: For 23/26 co-relation queries the response was YES. [2025-04-30 10:29:15,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 370 events. 71/370 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1750 event pairs, 32 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,055 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2025-04-30 10:29:15,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 112 transitions, 349 flow [2025-04-30 10:29:15,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:15,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2025-04-30 10:29:15,057 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8156028368794326 [2025-04-30 10:29:15,057 INFO L175 Difference]: Start difference. First operand has 103 places, 91 transitions, 217 flow. Second operand 6 states and 460 transitions. [2025-04-30 10:29:15,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 112 transitions, 349 flow [2025-04-30 10:29:15,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 112 transitions, 335 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-30 10:29:15,060 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 353 flow [2025-04-30 10:29:15,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=105, PETRI_TRANSITIONS=112} [2025-04-30 10:29:15,061 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2025-04-30 10:29:15,061 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 353 flow [2025-04-30 10:29:15,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:15,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:15,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:29:15,062 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,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash -179468783, now seen corresponding path program 1 times [2025-04-30 10:29:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:15,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829051513] [2025-04-30 10:29:15,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:15,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:29:15,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:29:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:15,334 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,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:15,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829051513] [2025-04-30 10:29:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829051513] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274379175] [2025-04-30 10:29:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:15,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:15,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:15,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:15,397 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2025-04-30 10:29:15,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 353 flow. Second operand has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 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,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:15,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2025-04-30 10:29:15,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:15,539 INFO L116 PetriNetUnfolderBase]: 131/506 cut-off events. [2025-04-30 10:29:15,539 INFO L117 PetriNetUnfolderBase]: For 134/136 co-relation queries the response was YES. [2025-04-30 10:29:15,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 506 events. 131/506 cut-off events. For 134/136 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2637 event pairs, 23 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 1014. Up to 240 conditions per place. [2025-04-30 10:29:15,542 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2025-04-30 10:29:15,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 155 transitions, 675 flow [2025-04-30 10:29:15,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2025-04-30 10:29:15,544 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8705673758865248 [2025-04-30 10:29:15,544 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 353 flow. Second operand 6 states and 491 transitions. [2025-04-30 10:29:15,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 155 transitions, 675 flow [2025-04-30 10:29:15,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:15,549 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2025-04-30 10:29:15,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=115, PETRI_TRANSITIONS=143} [2025-04-30 10:29:15,550 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2025-04-30 10:29:15,550 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2025-04-30 10:29:15,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 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,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:15,550 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,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:29:15,550 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,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1767281096, now seen corresponding path program 1 times [2025-04-30 10:29:15,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:15,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405947523] [2025-04-30 10:29:15,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:15,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:29:15,577 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,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:15,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:15,818 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,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:15,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405947523] [2025-04-30 10:29:15,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405947523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:15,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:15,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621883542] [2025-04-30 10:29:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:15,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:15,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:15,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:15,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2025-04-30 10:29:15,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 143 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:15,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2025-04-30 10:29:15,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:15,998 INFO L116 PetriNetUnfolderBase]: 142/514 cut-off events. [2025-04-30 10:29:15,998 INFO L117 PetriNetUnfolderBase]: For 447/457 co-relation queries the response was YES. [2025-04-30 10:29:15,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 514 events. 142/514 cut-off events. For 447/457 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2855 event pairs, 10 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 1507. Up to 241 conditions per place. [2025-04-30 10:29:16,001 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2025-04-30 10:29:16,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2025-04-30 10:29:16,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2025-04-30 10:29:16,003 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8315602836879432 [2025-04-30 10:29:16,003 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2025-04-30 10:29:16,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2025-04-30 10:29:16,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:16,013 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2025-04-30 10:29:16,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=114, PETRI_TRANSITIONS=158} [2025-04-30 10:29:16,015 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2025-04-30 10:29:16,015 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2025-04-30 10:29:16,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,016 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,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:29:16,017 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,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash 222417036, now seen corresponding path program 1 times [2025-04-30 10:29:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111763677] [2025-04-30 10:29:16,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:29:16,045 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,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:16,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:29:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-30 10:29:16,062 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,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:16,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:29:16,080 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:29:16,081 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-30 10:29:16,082 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-30 10:29:16,082 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-30 10:29:16,082 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-30 10:29:16,082 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-30 10:29:16,083 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-30 10:29:16,083 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-30 10:29:16,083 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-30 10:29:16,083 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-30 10:29:16,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:29:16,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:16,085 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:29:16,085 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:29:16,105 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:29:16,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 246 flow [2025-04-30 10:29:16,123 INFO L116 PetriNetUnfolderBase]: 4/216 cut-off events. [2025-04-30 10:29:16,123 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:29:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 4/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 495 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2025-04-30 10:29:16,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 115 transitions, 246 flow [2025-04-30 10:29:16,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 115 transitions, 246 flow [2025-04-30 10:29:16,125 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:16,130 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;@9e91a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:16,130 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-30 10:29:16,132 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:16,132 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-30 10:29:16,132 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:16,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:16,132 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,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash 987440408, now seen corresponding path program 1 times [2025-04-30 10:29:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171332167] [2025-04-30 10:29:16,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:29:16,142 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,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171332167] [2025-04-30 10:29:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171332167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950694401] [2025-04-30 10:29:16,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:16,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:16,180 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-04-30 10:29:16,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-04-30 10:29:16,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:16,229 INFO L116 PetriNetUnfolderBase]: 19/441 cut-off events. [2025-04-30 10:29:16,230 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-30 10:29:16,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 441 events. 19/441 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1872 event pairs, 16 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 287. Up to 50 conditions per place. [2025-04-30 10:29:16,232 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-04-30 10:29:16,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2025-04-30 10:29:16,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-04-30 10:29:16,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-04-30 10:29:16,233 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 246 flow. Second operand 3 states and 315 transitions. [2025-04-30 10:29:16,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2025-04-30 10:29:16,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:16,235 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2025-04-30 10:29:16,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2025-04-30 10:29:16,236 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2025-04-30 10:29:16,236 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2025-04-30 10:29:16,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:16,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:29:16,236 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,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash -127501339, now seen corresponding path program 1 times [2025-04-30 10:29:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084953094] [2025-04-30 10:29:16,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:29:16,244 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,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,254 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,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084953094] [2025-04-30 10:29:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084953094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930057710] [2025-04-30 10:29:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:16,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:16,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:16,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-04-30 10:29:16,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-04-30 10:29:16,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:16,329 INFO L116 PetriNetUnfolderBase]: 48/598 cut-off events. [2025-04-30 10:29:16,329 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-30 10:29:16,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 48/598 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2964 event pairs, 27 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 692. Up to 97 conditions per place. [2025-04-30 10:29:16,332 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-04-30 10:29:16,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2025-04-30 10:29:16,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2025-04-30 10:29:16,333 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9217391304347826 [2025-04-30 10:29:16,333 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2025-04-30 10:29:16,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2025-04-30 10:29:16,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:16,335 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2025-04-30 10:29:16,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-04-30 10:29:16,336 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-04-30 10:29:16,336 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2025-04-30 10:29:16,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,341 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,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:29:16,341 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,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1226371512, now seen corresponding path program 1 times [2025-04-30 10:29:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383238507] [2025-04-30 10:29:16,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:16,355 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,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,410 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,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383238507] [2025-04-30 10:29:16,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383238507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:16,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199957238] [2025-04-30 10:29:16,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:16,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:16,509 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-04-30 10:29:16,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-04-30 10:29:16,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:16,564 INFO L116 PetriNetUnfolderBase]: 12/349 cut-off events. [2025-04-30 10:29:16,564 INFO L117 PetriNetUnfolderBase]: For 35/55 co-relation queries the response was YES. [2025-04-30 10:29:16,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 349 events. 12/349 cut-off events. For 35/55 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1212 event pairs, 2 based on Foata normal form. 2/331 useless extension candidates. Maximal degree in co-relation 227. Up to 39 conditions per place. [2025-04-30 10:29:16,566 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 14 selfloop transitions, 2 changer transitions 5/118 dead transitions. [2025-04-30 10:29:16,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 309 flow [2025-04-30 10:29:16,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2025-04-30 10:29:16,568 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2025-04-30 10:29:16,568 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 616 transitions. [2025-04-30 10:29:16,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 309 flow [2025-04-30 10:29:16,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 309 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:16,570 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 277 flow [2025-04-30 10:29:16,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2025-04-30 10:29:16,570 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2025-04-30 10:29:16,571 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 277 flow [2025-04-30 10:29:16,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:16,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:16,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:29:16,571 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,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash -560294338, now seen corresponding path program 1 times [2025-04-30 10:29:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:16,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528022495] [2025-04-30 10:29:16,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:16,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:16,583 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,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:16,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:16,760 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,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:16,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528022495] [2025-04-30 10:29:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528022495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:16,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346879511] [2025-04-30 10:29:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:16,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:16,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:16,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:16,889 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2025-04-30 10:29:16,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:16,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2025-04-30 10:29:16,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:17,235 INFO L116 PetriNetUnfolderBase]: 1008/3102 cut-off events. [2025-04-30 10:29:17,235 INFO L117 PetriNetUnfolderBase]: For 201/207 co-relation queries the response was YES. [2025-04-30 10:29:17,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5157 conditions, 3102 events. 1008/3102 cut-off events. For 201/207 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 25417 event pairs, 589 based on Foata normal form. 0/2809 useless extension candidates. Maximal degree in co-relation 4564. Up to 1573 conditions per place. [2025-04-30 10:29:17,250 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 31 selfloop transitions, 38 changer transitions 0/151 dead transitions. [2025-04-30 10:29:17,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 496 flow [2025-04-30 10:29:17,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2025-04-30 10:29:17,252 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8304347826086956 [2025-04-30 10:29:17,252 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 277 flow. Second operand 6 states and 573 transitions. [2025-04-30 10:29:17,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 496 flow [2025-04-30 10:29:17,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 151 transitions, 484 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:17,255 INFO L231 Difference]: Finished difference. Result has 127 places, 150 transitions, 519 flow [2025-04-30 10:29:17,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=127, PETRI_TRANSITIONS=150} [2025-04-30 10:29:17,256 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2025-04-30 10:29:17,256 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 150 transitions, 519 flow [2025-04-30 10:29:17,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:17,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:17,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:29:17,257 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,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1717093438, now seen corresponding path program 1 times [2025-04-30 10:29:17,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:17,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92551040] [2025-04-30 10:29:17,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:17,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:29:17,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:29:17,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:17,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:17,475 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,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:17,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92551040] [2025-04-30 10:29:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92551040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:17,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785434543] [2025-04-30 10:29:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:17,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:17,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:17,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:17,567 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-04-30 10:29:17,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 150 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:17,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-04-30 10:29:17,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:18,281 INFO L116 PetriNetUnfolderBase]: 2425/6865 cut-off events. [2025-04-30 10:29:18,281 INFO L117 PetriNetUnfolderBase]: For 1840/2193 co-relation queries the response was YES. [2025-04-30 10:29:18,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14866 conditions, 6865 events. 2425/6865 cut-off events. For 1840/2193 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 62865 event pairs, 541 based on Foata normal form. 17/6318 useless extension candidates. Maximal degree in co-relation 12436. Up to 2883 conditions per place. [2025-04-30 10:29:18,324 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2025-04-30 10:29:18,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 260 transitions, 1347 flow [2025-04-30 10:29:18,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2025-04-30 10:29:18,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9028985507246376 [2025-04-30 10:29:18,326 INFO L175 Difference]: Start difference. First operand has 127 places, 150 transitions, 519 flow. Second operand 6 states and 623 transitions. [2025-04-30 10:29:18,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 260 transitions, 1347 flow [2025-04-30 10:29:18,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:18,337 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2025-04-30 10:29:18,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1245, PETRI_PLACES=136, PETRI_TRANSITIONS=233} [2025-04-30 10:29:18,338 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2025-04-30 10:29:18,338 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2025-04-30 10:29:18,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:18,338 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,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:29:18,338 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,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1576819970, now seen corresponding path program 1 times [2025-04-30 10:29:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:18,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343937478] [2025-04-30 10:29:18,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:18,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:18,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:29:18,353 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,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:18,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:18,560 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,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:18,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343937478] [2025-04-30 10:29:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343937478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972765303] [2025-04-30 10:29:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:18,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:18,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:18,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:18,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 115 [2025-04-30 10:29:18,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 233 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:18,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 115 [2025-04-30 10:29:18,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:19,506 INFO L116 PetriNetUnfolderBase]: 3065/8843 cut-off events. [2025-04-30 10:29:19,506 INFO L117 PetriNetUnfolderBase]: For 6865/7063 co-relation queries the response was YES. [2025-04-30 10:29:19,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24622 conditions, 8843 events. 3065/8843 cut-off events. For 6865/7063 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 87875 event pairs, 519 based on Foata normal form. 14/8290 useless extension candidates. Maximal degree in co-relation 23635. Up to 4189 conditions per place. [2025-04-30 10:29:19,608 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2025-04-30 10:29:19,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2025-04-30 10:29:19,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-04-30 10:29:19,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8463768115942029 [2025-04-30 10:29:19,610 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2025-04-30 10:29:19,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2025-04-30 10:29:19,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:19,640 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2025-04-30 10:29:19,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2007, PETRI_PLACES=146, PETRI_TRANSITIONS=299} [2025-04-30 10:29:19,641 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2025-04-30 10:29:19,641 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2025-04-30 10:29:19,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:19,642 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] [2025-04-30 10:29:19,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:29:19,642 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,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2037746063, now seen corresponding path program 1 times [2025-04-30 10:29:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:19,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512069894] [2025-04-30 10:29:19,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:19,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:29:19,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:29:19,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:19,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:20,090 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,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:20,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512069894] [2025-04-30 10:29:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512069894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:20,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:20,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952827960] [2025-04-30 10:29:20,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:20,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:20,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:20,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:20,539 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 115 [2025-04-30 10:29:20,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 299 transitions, 2007 flow. Second operand has 11 states, 11 states have (on average 78.18181818181819) internal successors, (860), 11 states have internal predecessors, (860), 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,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:20,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 115 [2025-04-30 10:29:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:21,710 INFO L116 PetriNetUnfolderBase]: 3384/9636 cut-off events. [2025-04-30 10:29:21,711 INFO L117 PetriNetUnfolderBase]: For 13155/13525 co-relation queries the response was YES. [2025-04-30 10:29:21,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30622 conditions, 9636 events. 3384/9636 cut-off events. For 13155/13525 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 96432 event pairs, 480 based on Foata normal form. 112/9169 useless extension candidates. Maximal degree in co-relation 29350. Up to 3017 conditions per place. [2025-04-30 10:29:21,767 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 310 selfloop transitions, 36 changer transitions 0/430 dead transitions. [2025-04-30 10:29:21,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 430 transitions, 3901 flow [2025-04-30 10:29:21,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:29:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:29:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1074 transitions. [2025-04-30 10:29:21,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7183946488294315 [2025-04-30 10:29:21,770 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 1074 transitions. [2025-04-30 10:29:21,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 430 transitions, 3901 flow [2025-04-30 10:29:21,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 430 transitions, 3761 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:21,806 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2025-04-30 10:29:21,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1935, PETRI_PLACES=157, PETRI_TRANSITIONS=298} [2025-04-30 10:29:21,807 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2025-04-30 10:29:21,807 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2025-04-30 10:29:21,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.18181818181819) internal successors, (860), 11 states have internal predecessors, (860), 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,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:21,808 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] [2025-04-30 10:29:21,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:29:21,808 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,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -507475364, now seen corresponding path program 1 times [2025-04-30 10:29:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:21,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690179568] [2025-04-30 10:29:21,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:21,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:29:21,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:29:21,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:21,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:22,151 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,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:22,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690179568] [2025-04-30 10:29:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690179568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457318616] [2025-04-30 10:29:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:22,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:22,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:22,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:22,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-04-30 10:29:22,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 298 transitions, 1935 flow. Second operand has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 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,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:22,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-04-30 10:29:22,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:24,193 INFO L116 PetriNetUnfolderBase]: 5094/12950 cut-off events. [2025-04-30 10:29:24,193 INFO L117 PetriNetUnfolderBase]: For 18197/20015 co-relation queries the response was YES. [2025-04-30 10:29:24,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43695 conditions, 12950 events. 5094/12950 cut-off events. For 18197/20015 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 127631 event pairs, 623 based on Foata normal form. 292/12706 useless extension candidates. Maximal degree in co-relation 39789. Up to 3162 conditions per place. [2025-04-30 10:29:24,293 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2025-04-30 10:29:24,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2025-04-30 10:29:24,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:29:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-30 10:29:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2025-04-30 10:29:24,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7695652173913043 [2025-04-30 10:29:24,297 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2025-04-30 10:29:24,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2025-04-30 10:29:24,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-30 10:29:24,369 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2025-04-30 10:29:24,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4571, PETRI_PLACES=172, PETRI_TRANSITIONS=504} [2025-04-30 10:29:24,370 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2025-04-30 10:29:24,371 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2025-04-30 10:29:24,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 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,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:24,371 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] [2025-04-30 10:29:24,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:29:24,371 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,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -359271321, now seen corresponding path program 1 times [2025-04-30 10:29:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:24,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223272738] [2025-04-30 10:29:24,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:24,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:29:24,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:29:24,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:24,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:24,740 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,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:24,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223272738] [2025-04-30 10:29:24,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223272738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:24,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:24,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265662827] [2025-04-30 10:29:24,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:24,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:24,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:24,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:25,168 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-04-30 10:29:25,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 504 transitions, 4571 flow. Second operand has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 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,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:25,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-04-30 10:29:25,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:26,616 INFO L116 PetriNetUnfolderBase]: 4493/12052 cut-off events. [2025-04-30 10:29:26,616 INFO L117 PetriNetUnfolderBase]: For 34226/34744 co-relation queries the response was YES. [2025-04-30 10:29:26,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48083 conditions, 12052 events. 4493/12052 cut-off events. For 34226/34744 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 121274 event pairs, 446 based on Foata normal form. 184/11666 useless extension candidates. Maximal degree in co-relation 46708. Up to 3248 conditions per place. [2025-04-30 10:29:26,705 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2025-04-30 10:29:26,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2025-04-30 10:29:26,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:29:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:29:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2025-04-30 10:29:26,708 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7344481605351171 [2025-04-30 10:29:26,708 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2025-04-30 10:29:26,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2025-04-30 10:29:26,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-04-30 10:29:26,895 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2025-04-30 10:29:26,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4585, PETRI_PLACES=178, PETRI_TRANSITIONS=503} [2025-04-30 10:29:26,897 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2025-04-30 10:29:26,897 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2025-04-30 10:29:26,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 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,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:26,897 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] [2025-04-30 10:29:26,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:29:26,898 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,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2022388250, now seen corresponding path program 1 times [2025-04-30 10:29:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:26,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218316495] [2025-04-30 10:29:26,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:26,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-30 10:29:26,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-30 10:29:26,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:26,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:29:27,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:27,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218316495] [2025-04-30 10:29:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218316495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137845637] [2025-04-30 10:29:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:27,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:27,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:27,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:27,285 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-04-30 10:29:27,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 503 transitions, 4585 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:27,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-04-30 10:29:27,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:27,972 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread2of2ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_4, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_4, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} AuxVars[] AssignedVars[#race][342], [Black: 204#(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))))), Black: 141#(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: 223#(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: 129#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 152#(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: 162#(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)), 66#L1036-1true, 118#true, 239#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 95#L1022-11true, Black: 154#(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))))), 263#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 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| 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: 153#(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: 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) (+ 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: 151#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 217#(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: 161#(= (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), 138#true, Black: 206#(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))))), Black: 123#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) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 202#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 203#(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))))), 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) 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: 142#(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|)), 149#true, 159#true, 125#(= |#race~datas~0| 0), 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|) (= (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|)), 116#true, Black: 207#(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))))), Black: 163#(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)), 64#L1022-7true, Black: 197#true, Black: 140#(= (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|)]) [2025-04-30 10:29:27,973 INFO L286 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-04-30 10:29:27,973 INFO L289 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-04-30 10:29:27,973 INFO L289 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-04-30 10:29:27,973 INFO L289 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-04-30 10:29:29,878 INFO L116 PetriNetUnfolderBase]: 9688/22033 cut-off events. [2025-04-30 10:29:29,878 INFO L117 PetriNetUnfolderBase]: For 74208/75146 co-relation queries the response was YES. [2025-04-30 10:29:29,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90091 conditions, 22033 events. 9688/22033 cut-off events. For 74208/75146 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 225859 event pairs, 1066 based on Foata normal form. 11/20903 useless extension candidates. Maximal degree in co-relation 88001. Up to 11078 conditions per place. [2025-04-30 10:29:30,072 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2025-04-30 10:29:30,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2025-04-30 10:29:30,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-04-30 10:29:30,074 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8971014492753623 [2025-04-30 10:29:30,074 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2025-04-30 10:29:30,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2025-04-30 10:29:30,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-30 10:29:30,473 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2025-04-30 10:29:30,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8336, PETRI_PLACES=175, PETRI_TRANSITIONS=778} [2025-04-30 10:29:30,474 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2025-04-30 10:29:30,474 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2025-04-30 10:29:30,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,474 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,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:29:30,475 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,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash -981390751, now seen corresponding path program 1 times [2025-04-30 10:29:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815493757] [2025-04-30 10:29:30,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:29:30,493 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,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:30,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:29:30,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:29:30,502 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,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:29:30,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:29:30,510 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:29:30,510 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-30 10:29:30,510 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-30 10:29:30,510 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-30 10:29:30,510 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-30 10:29:30,511 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-30 10:29:30,511 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-30 10:29:30,511 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-30 10:29:30,511 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-30 10:29:30,511 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-30 10:29:30,511 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-30 10:29:30,511 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-30 10:29:30,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:29:30,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:30,511 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:29:30,511 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-30 10:29:30,536 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-30 10:29:30,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 136 transitions, 299 flow [2025-04-30 10:29:30,562 INFO L116 PetriNetUnfolderBase]: 9/356 cut-off events. [2025-04-30 10:29:30,563 INFO L117 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-04-30 10:29:30,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 356 events. 9/356 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1012 event pairs, 1 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 224. Up to 12 conditions per place. [2025-04-30 10:29:30,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 136 transitions, 299 flow [2025-04-30 10:29:30,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 299 flow [2025-04-30 10:29:30,565 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:30,566 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;@9e91a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:30,566 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:29:30,567 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:30,567 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-30 10:29:30,567 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:30,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,567 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,568 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,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1606972768, now seen corresponding path program 1 times [2025-04-30 10:29:30,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937048376] [2025-04-30 10:29:30,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:29:30,573 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,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:30,581 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,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:30,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937048376] [2025-04-30 10:29:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937048376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:30,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061848083] [2025-04-30 10:29:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:30,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:30,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:30,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:30,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:30,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-04-30 10:29:30,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:30,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-04-30 10:29:30,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:30,710 INFO L116 PetriNetUnfolderBase]: 90/1260 cut-off events. [2025-04-30 10:29:30,710 INFO L117 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-04-30 10:29:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1260 events. 90/1260 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8340 event pairs, 81 based on Foata normal form. 1/1092 useless extension candidates. Maximal degree in co-relation 877. Up to 178 conditions per place. [2025-04-30 10:29:30,717 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-04-30 10:29:30,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2025-04-30 10:29:30,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-04-30 10:29:30,718 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9117647058823529 [2025-04-30 10:29:30,718 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 299 flow. Second operand 3 states and 372 transitions. [2025-04-30 10:29:30,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2025-04-30 10:29:30,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:30,720 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2025-04-30 10:29:30,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2025-04-30 10:29:30,721 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2025-04-30 10:29:30,721 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2025-04-30 10:29:30,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,721 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,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:29:30,721 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,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash -322593563, now seen corresponding path program 1 times [2025-04-30 10:29:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989805595] [2025-04-30 10:29:30,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:29:30,728 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,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:30,736 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,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:30,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989805595] [2025-04-30 10:29:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989805595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:30,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:30,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300978076] [2025-04-30 10:29:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:30,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:30,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:30,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:30,750 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2025-04-30 10:29:30,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:30,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2025-04-30 10:29:30,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:30,946 INFO L116 PetriNetUnfolderBase]: 307/2452 cut-off events. [2025-04-30 10:29:30,946 INFO L117 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2025-04-30 10:29:30,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 2452 events. 307/2452 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19897 event pairs, 214 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 3039. Up to 507 conditions per place. [2025-04-30 10:29:30,959 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-04-30 10:29:30,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2025-04-30 10:29:30,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-04-30 10:29:30,961 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9142156862745098 [2025-04-30 10:29:30,961 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2025-04-30 10:29:30,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2025-04-30 10:29:30,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:30,963 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2025-04-30 10:29:30,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-04-30 10:29:30,963 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2025-04-30 10:29:30,964 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2025-04-30 10:29:30,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:30,964 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,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:29:30,964 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,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 268566600, now seen corresponding path program 1 times [2025-04-30 10:29:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:30,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104493937] [2025-04-30 10:29:30,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:30,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:30,972 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,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:30,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:31,003 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,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:31,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104493937] [2025-04-30 10:29:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104493937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:31,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:31,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125836793] [2025-04-30 10:29:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:31,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:31,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:31,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:31,064 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-04-30 10:29:31,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:31,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-04-30 10:29:31,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:31,149 INFO L116 PetriNetUnfolderBase]: 50/845 cut-off events. [2025-04-30 10:29:31,149 INFO L117 PetriNetUnfolderBase]: For 130/199 co-relation queries the response was YES. [2025-04-30 10:29:31,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 845 events. 50/845 cut-off events. For 130/199 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4626 event pairs, 16 based on Foata normal form. 2/787 useless extension candidates. Maximal degree in co-relation 613. Up to 99 conditions per place. [2025-04-30 10:29:31,153 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 16 selfloop transitions, 2 changer transitions 5/139 dead transitions. [2025-04-30 10:29:31,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 371 flow [2025-04-30 10:29:31,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-04-30 10:29:31,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2025-04-30 10:29:31,155 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 732 transitions. [2025-04-30 10:29:31,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 371 flow [2025-04-30 10:29:31,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:31,157 INFO L231 Difference]: Finished difference. Result has 145 places, 134 transitions, 335 flow [2025-04-30 10:29:31,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=145, PETRI_TRANSITIONS=134} [2025-04-30 10:29:31,158 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-04-30 10:29:31,158 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 134 transitions, 335 flow [2025-04-30 10:29:31,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:31,158 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,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:29:31,158 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,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash 934643774, now seen corresponding path program 1 times [2025-04-30 10:29:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:31,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95238446] [2025-04-30 10:29:31,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:31,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:31,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:29:31,167 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,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:31,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:31,284 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,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:31,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95238446] [2025-04-30 10:29:31,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95238446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:31,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:31,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:31,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739368065] [2025-04-30 10:29:31,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:31,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:31,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:31,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:31,402 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 136 [2025-04-30 10:29:31,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:31,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 136 [2025-04-30 10:29:31,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:33,412 INFO L116 PetriNetUnfolderBase]: 10403/23606 cut-off events. [2025-04-30 10:29:33,413 INFO L117 PetriNetUnfolderBase]: For 2046/2115 co-relation queries the response was YES. [2025-04-30 10:29:33,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40718 conditions, 23606 events. 10403/23606 cut-off events. For 2046/2115 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 238026 event pairs, 6819 based on Foata normal form. 0/21686 useless extension candidates. Maximal degree in co-relation 35491. Up to 14137 conditions per place. [2025-04-30 10:29:33,508 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 38 selfloop transitions, 54 changer transitions 0/189 dead transitions. [2025-04-30 10:29:33,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 641 flow [2025-04-30 10:29:33,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2025-04-30 10:29:33,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8406862745098039 [2025-04-30 10:29:33,509 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 335 flow. Second operand 6 states and 686 transitions. [2025-04-30 10:29:33,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 641 flow [2025-04-30 10:29:33,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 189 transitions, 629 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:33,515 INFO L231 Difference]: Finished difference. Result has 148 places, 187 transitions, 681 flow [2025-04-30 10:29:33,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=148, PETRI_TRANSITIONS=187} [2025-04-30 10:29:33,515 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-04-30 10:29:33,516 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 681 flow [2025-04-30 10:29:33,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:33,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:33,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:29:33,516 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,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 330540977, now seen corresponding path program 1 times [2025-04-30 10:29:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:33,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415425355] [2025-04-30 10:29:33,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:33,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:29:33,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:29:33,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:33,639 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,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:33,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415425355] [2025-04-30 10:29:33,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415425355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:33,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:33,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522415910] [2025-04-30 10:29:33,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:33,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:33,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:33,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:33,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2025-04-30 10:29:33,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 187 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 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,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:33,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2025-04-30 10:29:33,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:36,294 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][287], [Black: 163#(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#L1022-11true, 88#L1022-7true, Black: 162#(= (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: 145#true, Black: 164#(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|)), 136#true, 115#L1022-7true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 160#true, 138#true, Black: 165#(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|)), 103#L1031-9true]) [2025-04-30 10:29:36,294 INFO L286 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-04-30 10:29:36,294 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-30 10:29:36,295 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-30 10:29:36,295 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-30 10:29:36,502 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][287], [Black: 163#(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#L1022-11true, Black: 145#true, Black: 162#(= (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: 164#(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|)), 136#true, 115#L1022-7true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 160#true, 138#true, Black: 165#(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|)), 76#L1022-8true, 103#L1031-9true]) [2025-04-30 10:29:36,502 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:29:36,502 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:29:36,502 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:29:36,502 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:29:36,694 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][287], [Black: 163#(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#L1022-11true, 33#L1022-9true, Black: 145#true, Black: 162#(= (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: 164#(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|)), 136#true, 115#L1022-7true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 160#true, 138#true, Black: 165#(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|)), 103#L1031-9true]) [2025-04-30 10:29:36,694 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:29:36,694 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:29:36,695 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:29:36,695 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:29:36,865 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][287], [Black: 163#(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#L1022-11true, Black: 162#(= (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: 145#true, Black: 164#(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|)), 136#true, 115#L1022-7true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 138#true, 160#true, Black: 165#(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|)), 103#L1031-9true, 93#L1022-10true]) [2025-04-30 10:29:36,865 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-30 10:29:36,865 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:36,866 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:36,866 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:39,251 INFO L116 PetriNetUnfolderBase]: 29087/67029 cut-off events. [2025-04-30 10:29:39,251 INFO L117 PetriNetUnfolderBase]: For 19583/23396 co-relation queries the response was YES. [2025-04-30 10:29:39,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150403 conditions, 67029 events. 29087/67029 cut-off events. For 19583/23396 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 770348 event pairs, 6935 based on Foata normal form. 90/61634 useless extension candidates. Maximal degree in co-relation 123146. Up to 28768 conditions per place. [2025-04-30 10:29:39,698 INFO L140 encePairwiseOnDemand]: 113/136 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2025-04-30 10:29:39,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 349 transitions, 1945 flow [2025-04-30 10:29:39,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2025-04-30 10:29:39,699 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9105392156862745 [2025-04-30 10:29:39,699 INFO L175 Difference]: Start difference. First operand has 148 places, 187 transitions, 681 flow. Second operand 6 states and 743 transitions. [2025-04-30 10:29:39,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 349 transitions, 1945 flow [2025-04-30 10:29:39,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:39,765 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2025-04-30 10:29:39,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1754, PETRI_PLACES=157, PETRI_TRANSITIONS=304} [2025-04-30 10:29:39,765 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2025-04-30 10:29:39,765 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2025-04-30 10:29:39,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 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,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:39,766 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,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:29:39,766 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,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1497228185, now seen corresponding path program 1 times [2025-04-30 10:29:39,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:39,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119097240] [2025-04-30 10:29:39,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:39,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-30 10:29:39,779 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,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:39,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:39,899 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,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:39,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119097240] [2025-04-30 10:29:39,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119097240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:39,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417737257] [2025-04-30 10:29:39,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:39,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:39,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:39,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:40,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 136 [2025-04-30 10:29:40,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 304 transitions, 1754 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 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:40,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:40,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 136 [2025-04-30 10:29:40,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:48,313 INFO L116 PetriNetUnfolderBase]: 35398/83174 cut-off events. [2025-04-30 10:29:48,313 INFO L117 PetriNetUnfolderBase]: For 74836/77480 co-relation queries the response was YES. [2025-04-30 10:29:48,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243094 conditions, 83174 events. 35398/83174 cut-off events. For 74836/77480 co-relation queries the response was YES. Maximal size of possible extension queue 2691. Compared 1010313 event pairs, 8808 based on Foata normal form. 195/77623 useless extension candidates. Maximal degree in co-relation 233161. Up to 43670 conditions per place. [2025-04-30 10:29:48,978 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2025-04-30 10:29:48,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2025-04-30 10:29:48,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2025-04-30 10:29:48,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-04-30 10:29:48,980 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2025-04-30 10:29:48,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2025-04-30 10:29:49,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:49,630 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2025-04-30 10:29:49,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2981, PETRI_PLACES=167, PETRI_TRANSITIONS=409} [2025-04-30 10:29:49,630 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2025-04-30 10:29:49,631 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2025-04-30 10:29:49,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 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,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:49,631 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] [2025-04-30 10:29:49,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:29:49,631 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,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:49,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1409203062, now seen corresponding path program 1 times [2025-04-30 10:29:49,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:49,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608187992] [2025-04-30 10:29:49,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:49,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:29:49,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:29:49,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:49,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:49,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608187992] [2025-04-30 10:29:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608187992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:29:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538946754] [2025-04-30 10:29:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:49,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:29:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:49,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:29:49,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:29:50,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 136 [2025-04-30 10:29:50,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 409 transitions, 2981 flow. Second operand has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 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,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:50,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 136 [2025-04-30 10:29:50,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:56,078 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][373], [Black: 163#(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: 186#(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)), 79#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 162#(= (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: 183#(= (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: 164#(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: 175#(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|)), 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 181#true, Black: 174#(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|)), 138#true, Black: 185#(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: 145#true, Black: 184#(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)), 136#true, 171#true, 115#L1022-7true, 27#L1022-10true, 140#true, Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 160#true, Black: 165#(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|)), 93#L1022-10true, Black: 176#(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|))]) [2025-04-30 10:29:56,078 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:29:56,078 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:29:56,078 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:29:56,078 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:29:57,604 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][373], [Black: 163#(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|)), 33#L1022-9true, 79#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 186#(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)), 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 162#(= (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: 183#(= (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: 164#(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: 175#(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|)), 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 181#true, Black: 174#(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|)), 138#true, Black: 185#(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: 145#true, Black: 184#(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)), 136#true, 171#true, 115#L1022-7true, 27#L1022-10true, 140#true, Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 160#true, Black: 165#(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: 176#(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|))]) [2025-04-30 10:29:57,604 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:29:57,604 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:29:57,604 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:29:57,604 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:29:58,390 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][383], [Black: 163#(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|)), 79#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 186#(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)), 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 162#(= (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: 183#(= (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: 164#(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: 175#(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|)), 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 181#true, Black: 174#(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|)), 138#true, Black: 185#(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)), 37#L1022-11true, Black: 184#(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: 145#true, 136#true, 115#L1022-7true, 171#true, 140#true, Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 160#true, Black: 165#(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|)), 93#L1022-10true, Black: 176#(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|))]) [2025-04-30 10:29:58,390 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-30 10:29:58,390 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:58,390 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:58,391 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:29:58,705 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][373], [Black: 163#(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|)), 79#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 186#(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)), 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 162#(= (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: 183#(= (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: 164#(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: 175#(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|)), 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 181#true, 138#true, Black: 174#(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|)), Black: 185#(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: 145#true, Black: 184#(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)), 136#true, 171#true, 115#L1022-7true, 140#true, Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 160#true, Black: 165#(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|)), 129#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 93#L1022-10true, Black: 176#(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|))]) [2025-04-30 10:29:58,705 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2025-04-30 10:29:58,705 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-04-30 10:29:58,705 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-04-30 10:29:58,705 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event