./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-array-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-array-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 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:44:16,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:44:16,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:44:16,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:44:16,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:44:16,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:44:16,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:44:16,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:44:16,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:44:16,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:44:16,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:44:16,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:44:16,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:44:16,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:44:16,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:44:16,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:44:16,933 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 -> 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 [2025-03-04 06:44:17,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:44:17,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:44:17,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:44:17,183 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:44:17,183 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:44:17,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2025-03-04 06:44:18,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42b1f73/7ad6bbee8c1e433586d7d0acc7115dfb/FLAGfb7480178 [2025-03-04 06:44:18,678 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:44:18,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2025-03-04 06:44:18,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42b1f73/7ad6bbee8c1e433586d7d0acc7115dfb/FLAGfb7480178 [2025-03-04 06:44:18,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a42b1f73/7ad6bbee8c1e433586d7d0acc7115dfb [2025-03-04 06:44:18,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:44:18,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:44:18,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:44:18,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:44:18,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:44:18,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:44:18" (1/1) ... [2025-03-04 06:44:18,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:18, skipping insertion in model container [2025-03-04 06:44:18,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:44:18" (1/1) ... [2025-03-04 06:44:18,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:44:19,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:44:19,219 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:44:19,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:44:19,292 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:44:19,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19 WrapperNode [2025-03-04 06:44:19,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:44:19,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:44:19,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:44:19,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:44:19,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,325 INFO L138 Inliner]: procedures = 169, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2025-03-04 06:44:19,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:44:19,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:44:19,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:44:19,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:44:19,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:44:19,355 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:44:19,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:44:19,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:44:19,360 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (1/1) ... [2025-03-04 06:44:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:44:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:44:19,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:44:19,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:44:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:44:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:44:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-04 06:44:19,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-04 06:44:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:44:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:44:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:44:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:44:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:44:19,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:44:19,410 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:44:19,509 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:44:19,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:44:19,697 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc main_~#t~1#1.base, main_~#t~1#1.offset; [2025-03-04 06:44:19,698 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~1#1.base, main_~#t~1#1.offset); srcloc: null [2025-03-04 06:44:19,726 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:44:19,726 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:44:19,733 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:44:19,733 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:44:19,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:44:19 BoogieIcfgContainer [2025-03-04 06:44:19,734 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:44:19,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:44:19,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:44:19,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:44:19,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:44:18" (1/3) ... [2025-03-04 06:44:19,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e56d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:44:19, skipping insertion in model container [2025-03-04 06:44:19,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:44:19" (2/3) ... [2025-03-04 06:44:19,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e56d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:44:19, skipping insertion in model container [2025-03-04 06:44:19,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:44:19" (3/3) ... [2025-03-04 06:44:19,741 INFO L128 eAbstractionObserver]: Analyzing ICFG nondet-array-2.i [2025-03-04 06:44:19,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:44:19,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nondet-array-2.i that has 2 procedures, 124 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 06:44:19,753 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:44:19,805 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:44:19,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 265 flow [2025-03-04 06:44:19,896 INFO L124 PetriNetUnfolderBase]: 8/187 cut-off events. [2025-03-04 06:44:19,899 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:44:19,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 187 events. 8/187 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 459 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2025-03-04 06:44:19,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 129 transitions, 265 flow [2025-03-04 06:44:19,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 265 flow [2025-03-04 06:44:19,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:44:19,924 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23f24b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:44:19,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:44:19,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:44:19,942 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-03-04 06:44:19,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:44:19,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:19,944 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] [2025-03-04 06:44:19,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:44:19,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash 659406269, now seen corresponding path program 1 times [2025-03-04 06:44:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-04 06:44:19,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:20,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:44:20,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:44:20,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:20,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520830732] [2025-03-04 06:44:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520830732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:20,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:20,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456016737] [2025-03-04 06:44:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:20,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:44:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:20,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:44:20,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:44:20,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2025-03-04 06:44:20,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:20,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:20,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2025-03-04 06:44:20,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:20,613 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2025-03-04 06:44:20,613 INFO L125 PetriNetUnfolderBase]: For 12/20 co-relation queries the response was YES. [2025-03-04 06:44:20,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 196 events. 3/196 cut-off events. For 12/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 316 event pairs, 0 based on Foata normal form. 9/186 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2025-03-04 06:44:20,615 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 16 selfloop transitions, 8 changer transitions 7/136 dead transitions. [2025-03-04 06:44:20,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 339 flow [2025-03-04 06:44:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:44:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:44:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2025-03-04 06:44:20,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011627906976745 [2025-03-04 06:44:20,631 INFO L175 Difference]: Start difference. First operand has 127 places, 129 transitions, 265 flow. Second operand 4 states and 465 transitions. [2025-03-04 06:44:20,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 136 transitions, 339 flow [2025-03-04 06:44:20,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:20,639 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 305 flow [2025-03-04 06:44:20,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2025-03-04 06:44:20,647 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2025-03-04 06:44:20,647 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 305 flow [2025-03-04 06:44:20,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:20,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:20,648 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] [2025-03-04 06:44:20,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:44:20,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:44:20,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:20,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1869545041, now seen corresponding path program 1 times [2025-03-04 06:44:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:20,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036489536] [2025-03-04 06:44:20,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:20,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:44:20,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:44:20,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:20,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036489536] [2025-03-04 06:44:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036489536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:21,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017334680] [2025-03-04 06:44:21,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:21,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:21,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:21,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 129 [2025-03-04 06:44:21,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:21,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:21,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 129 [2025-03-04 06:44:21,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:21,335 INFO L124 PetriNetUnfolderBase]: 83/506 cut-off events. [2025-03-04 06:44:21,335 INFO L125 PetriNetUnfolderBase]: For 64/70 co-relation queries the response was YES. [2025-03-04 06:44:21,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 506 events. 83/506 cut-off events. For 64/70 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2500 event pairs, 47 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 640. Up to 191 conditions per place. [2025-03-04 06:44:21,340 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 35 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-03-04 06:44:21,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 461 flow [2025-03-04 06:44:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2025-03-04 06:44:21,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-03-04 06:44:21,344 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 305 flow. Second operand 6 states and 602 transitions. [2025-03-04 06:44:21,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 461 flow [2025-03-04 06:44:21,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 459 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:21,349 INFO L231 Difference]: Finished difference. Result has 140 places, 147 transitions, 453 flow [2025-03-04 06:44:21,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=140, PETRI_TRANSITIONS=147} [2025-03-04 06:44:21,350 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 13 predicate places. [2025-03-04 06:44:21,350 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 147 transitions, 453 flow [2025-03-04 06:44:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:21,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:21,350 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] [2025-03-04 06:44:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:44:21,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:44:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash -130014278, now seen corresponding path program 1 times [2025-03-04 06:44:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072648300] [2025-03-04 06:44:21,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:21,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:21,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 06:44:21,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 06:44:21,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:21,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:21,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072648300] [2025-03-04 06:44:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072648300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:21,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:44:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163583479] [2025-03-04 06:44:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:21,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:44:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:21,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:44:21,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:44:21,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 129 [2025-03-04 06:44:21,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 147 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:21,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:21,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 129 [2025-03-04 06:44:21,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:21,436 INFO L124 PetriNetUnfolderBase]: 33/312 cut-off events. [2025-03-04 06:44:21,436 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 06:44:21,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 312 events. 33/312 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1022 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 424. Up to 45 conditions per place. [2025-03-04 06:44:21,438 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 3 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-04 06:44:21,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 146 transitions, 461 flow [2025-03-04 06:44:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:44:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:44:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-03-04 06:44:21,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2025-03-04 06:44:21,440 INFO L175 Difference]: Start difference. First operand has 140 places, 147 transitions, 453 flow. Second operand 3 states and 363 transitions. [2025-03-04 06:44:21,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 146 transitions, 461 flow [2025-03-04 06:44:21,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 146 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:21,447 INFO L231 Difference]: Finished difference. Result has 141 places, 146 transitions, 455 flow [2025-03-04 06:44:21,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=141, PETRI_TRANSITIONS=146} [2025-03-04 06:44:21,448 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 14 predicate places. [2025-03-04 06:44:21,448 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 146 transitions, 455 flow [2025-03-04 06:44:21,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:21,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:21,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:21,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:44:21,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:44:21,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1375315518, now seen corresponding path program 1 times [2025-03-04 06:44:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:21,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-03-04 06:44:21,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:21,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:44:21,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:44:21,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:21,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:21,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:21,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49895653] [2025-03-04 06:44:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49895653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:21,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170087145] [2025-03-04 06:44:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:21,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:21,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:21,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 129 [2025-03-04 06:44:21,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 146 transitions, 455 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-03-04 06:44:21,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:21,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 129 [2025-03-04 06:44:21,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:22,062 INFO L124 PetriNetUnfolderBase]: 131/551 cut-off events. [2025-03-04 06:44:22,062 INFO L125 PetriNetUnfolderBase]: For 147/162 co-relation queries the response was YES. [2025-03-04 06:44:22,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 551 events. 131/551 cut-off events. For 147/162 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2609 event pairs, 23 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 1097. Up to 247 conditions per place. [2025-03-04 06:44:22,065 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 38 selfloop transitions, 48 changer transitions 0/189 dead transitions. [2025-03-04 06:44:22,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 189 transitions, 783 flow [2025-03-04 06:44:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2025-03-04 06:44:22,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630490956072352 [2025-03-04 06:44:22,067 INFO L175 Difference]: Start difference. First operand has 141 places, 146 transitions, 455 flow. Second operand 6 states and 668 transitions. [2025-03-04 06:44:22,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 189 transitions, 783 flow [2025-03-04 06:44:22,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 189 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:44:22,072 INFO L231 Difference]: Finished difference. Result has 149 places, 189 transitions, 839 flow [2025-03-04 06:44:22,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=149, PETRI_TRANSITIONS=189} [2025-03-04 06:44:22,073 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 22 predicate places. [2025-03-04 06:44:22,073 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 189 transitions, 839 flow [2025-03-04 06:44:22,073 INFO L472 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-03-04 06:44:22,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:22,074 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] [2025-03-04 06:44:22,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:44:22,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:44:22,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:22,074 INFO L85 PathProgramCache]: Analyzing trace with hash -651027704, now seen corresponding path program 1 times [2025-03-04 06:44:22,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-04 06:44:22,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:22,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:44:22,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:44:22,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:22,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:22,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:22,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-04 06:44:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445899137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:22,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:22,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27969165] [2025-03-04 06:44:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:22,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:22,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:22,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:22,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 129 [2025-03-04 06:44:22,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 189 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:22,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:22,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 129 [2025-03-04 06:44:22,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:22,666 INFO L124 PetriNetUnfolderBase]: 159/718 cut-off events. [2025-03-04 06:44:22,666 INFO L125 PetriNetUnfolderBase]: For 551/624 co-relation queries the response was YES. [2025-03-04 06:44:22,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 718 events. 159/718 cut-off events. For 551/624 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4096 event pairs, 26 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 1774. Up to 300 conditions per place. [2025-03-04 06:44:22,670 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 87 selfloop transitions, 32 changer transitions 0/217 dead transitions. [2025-03-04 06:44:22,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 217 transitions, 1248 flow [2025-03-04 06:44:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2025-03-04 06:44:22,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8178294573643411 [2025-03-04 06:44:22,672 INFO L175 Difference]: Start difference. First operand has 149 places, 189 transitions, 839 flow. Second operand 6 states and 633 transitions. [2025-03-04 06:44:22,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 217 transitions, 1248 flow [2025-03-04 06:44:22,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 217 transitions, 1230 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:22,684 INFO L231 Difference]: Finished difference. Result has 159 places, 216 transitions, 1147 flow [2025-03-04 06:44:22,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1147, PETRI_PLACES=159, PETRI_TRANSITIONS=216} [2025-03-04 06:44:22,686 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 32 predicate places. [2025-03-04 06:44:22,686 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 216 transitions, 1147 flow [2025-03-04 06:44:22,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:22,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:22,686 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-03-04 06:44:22,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:44:22,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:44:22,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:22,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1112608458, now seen corresponding path program 1 times [2025-03-04 06:44:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:22,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270289497] [2025-03-04 06:44:22,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:22,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:44:22,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:44:22,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:22,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:22,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270289497] [2025-03-04 06:44:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270289497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:22,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:22,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:44:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994935133] [2025-03-04 06:44:22,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:22,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:44:22,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:22,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:44:22,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:44:22,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2025-03-04 06:44:22,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 216 transitions, 1147 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:22,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:22,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2025-03-04 06:44:22,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:22,831 INFO L124 PetriNetUnfolderBase]: 136/592 cut-off events. [2025-03-04 06:44:22,831 INFO L125 PetriNetUnfolderBase]: For 470/487 co-relation queries the response was YES. [2025-03-04 06:44:22,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 592 events. 136/592 cut-off events. For 470/487 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3027 event pairs, 6 based on Foata normal form. 1/589 useless extension candidates. Maximal degree in co-relation 1571. Up to 129 conditions per place. [2025-03-04 06:44:22,836 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 5 selfloop transitions, 2 changer transitions 19/215 dead transitions. [2025-03-04 06:44:22,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 215 transitions, 1159 flow [2025-03-04 06:44:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:44:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:44:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-03-04 06:44:22,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276485788113695 [2025-03-04 06:44:22,838 INFO L175 Difference]: Start difference. First operand has 159 places, 216 transitions, 1147 flow. Second operand 3 states and 359 transitions. [2025-03-04 06:44:22,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 215 transitions, 1159 flow [2025-03-04 06:44:22,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 215 transitions, 1103 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:22,847 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 1043 flow [2025-03-04 06:44:22,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=160, PETRI_TRANSITIONS=196} [2025-03-04 06:44:22,849 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 33 predicate places. [2025-03-04 06:44:22,849 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 1043 flow [2025-03-04 06:44:22,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:22,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:22,850 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] [2025-03-04 06:44:22,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:44:22,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:44:22,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1272015797, now seen corresponding path program 1 times [2025-03-04 06:44:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501267730] [2025-03-04 06:44:22,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:22,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:44:22,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:44:22,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:22,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:44:22,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:44:22,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:44:22,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:44:22,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:22,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:44:22,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:44:22,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:44:22,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:44:22,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:44:22,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:44:22,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:44:22,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:44:22,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:44:22,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:44:22,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:44:22,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:44:22,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:44:22,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:44:22,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:22,922 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:44:22,923 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:44:22,941 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:44:22,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 152 transitions, 320 flow [2025-03-04 06:44:22,968 INFO L124 PetriNetUnfolderBase]: 16/329 cut-off events. [2025-03-04 06:44:22,968 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-04 06:44:22,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 329 events. 16/329 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 947 event pairs, 0 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2025-03-04 06:44:22,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 152 transitions, 320 flow [2025-03-04 06:44:22,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 152 transitions, 320 flow [2025-03-04 06:44:22,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:44:22,972 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23f24b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:44:22,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 06:44:22,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:44:22,977 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-03-04 06:44:22,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:44:22,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:22,978 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] [2025-03-04 06:44:22,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash -799400003, now seen corresponding path program 1 times [2025-03-04 06:44:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-03-04 06:44:22,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:22,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:22,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:44:22,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:44:22,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:22,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-03-04 06:44:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269030379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:23,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:23,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122822815] [2025-03-04 06:44:23,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:23,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:44:23,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:23,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:44:23,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:44:23,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 152 [2025-03-04 06:44:23,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 152 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:23,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:23,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 152 [2025-03-04 06:44:23,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:23,178 INFO L124 PetriNetUnfolderBase]: 10/400 cut-off events. [2025-03-04 06:44:23,179 INFO L125 PetriNetUnfolderBase]: For 28/46 co-relation queries the response was YES. [2025-03-04 06:44:23,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 400 events. 10/400 cut-off events. For 28/46 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1287 event pairs, 0 based on Foata normal form. 19/377 useless extension candidates. Maximal degree in co-relation 231. Up to 42 conditions per place. [2025-03-04 06:44:23,181 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 24 selfloop transitions, 9 changer transitions 4/163 dead transitions. [2025-03-04 06:44:23,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 420 flow [2025-03-04 06:44:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:44:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:44:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2025-03-04 06:44:23,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912828947368421 [2025-03-04 06:44:23,185 INFO L175 Difference]: Start difference. First operand has 151 places, 152 transitions, 320 flow. Second operand 4 states and 555 transitions. [2025-03-04 06:44:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 420 flow [2025-03-04 06:44:23,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 163 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:23,188 INFO L231 Difference]: Finished difference. Result has 155 places, 153 transitions, 378 flow [2025-03-04 06:44:23,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=155, PETRI_TRANSITIONS=153} [2025-03-04 06:44:23,189 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 4 predicate places. [2025-03-04 06:44:23,189 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 153 transitions, 378 flow [2025-03-04 06:44:23,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:23,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:23,190 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] [2025-03-04 06:44:23,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:44:23,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:23,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash 152100935, now seen corresponding path program 1 times [2025-03-04 06:44:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:23,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709791324] [2025-03-04 06:44:23,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:23,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:23,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:44:23,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:44:23,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:23,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709791324] [2025-03-04 06:44:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709791324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99042447] [2025-03-04 06:44:23,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:23,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:23,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:23,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:23,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 152 [2025-03-04 06:44:23,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 153 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:23,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:23,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 152 [2025-03-04 06:44:23,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:23,990 INFO L124 PetriNetUnfolderBase]: 1178/4239 cut-off events. [2025-03-04 06:44:23,990 INFO L125 PetriNetUnfolderBase]: For 444/466 co-relation queries the response was YES. [2025-03-04 06:44:24,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 4239 events. 1178/4239 cut-off events. For 444/466 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 36398 event pairs, 769 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 4257. Up to 1921 conditions per place. [2025-03-04 06:44:24,014 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 45 selfloop transitions, 38 changer transitions 0/191 dead transitions. [2025-03-04 06:44:24,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 191 transitions, 625 flow [2025-03-04 06:44:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2025-03-04 06:44:24,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7971491228070176 [2025-03-04 06:44:24,016 INFO L175 Difference]: Start difference. First operand has 155 places, 153 transitions, 378 flow. Second operand 6 states and 727 transitions. [2025-03-04 06:44:24,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 191 transitions, 625 flow [2025-03-04 06:44:24,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 191 transitions, 623 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:24,021 INFO L231 Difference]: Finished difference. Result has 164 places, 190 transitions, 630 flow [2025-03-04 06:44:24,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=164, PETRI_TRANSITIONS=190} [2025-03-04 06:44:24,022 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 13 predicate places. [2025-03-04 06:44:24,022 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 190 transitions, 630 flow [2025-03-04 06:44:24,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:24,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:24,022 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] [2025-03-04 06:44:24,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:44:24,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:24,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:24,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1515207058, now seen corresponding path program 1 times [2025-03-04 06:44:24,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:24,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-04 06:44:24,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:24,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 06:44:24,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 06:44:24,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:24,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:24,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:24,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-04 06:44:24,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474866706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:24,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:24,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:44:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798904773] [2025-03-04 06:44:24,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:24,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:44:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:24,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:44:24,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:44:24,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-03-04 06:44:24,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 190 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:24,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:24,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-03-04 06:44:24,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:24,388 INFO L124 PetriNetUnfolderBase]: 670/3655 cut-off events. [2025-03-04 06:44:24,388 INFO L125 PetriNetUnfolderBase]: For 540/552 co-relation queries the response was YES. [2025-03-04 06:44:24,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 3655 events. 670/3655 cut-off events. For 540/552 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 32798 event pairs, 124 based on Foata normal form. 0/3326 useless extension candidates. Maximal degree in co-relation 5016. Up to 762 conditions per place. [2025-03-04 06:44:24,407 INFO L140 encePairwiseOnDemand]: 144/152 looper letters, 15 selfloop transitions, 6 changer transitions 0/199 dead transitions. [2025-03-04 06:44:24,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 199 transitions, 701 flow [2025-03-04 06:44:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:44:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:44:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2025-03-04 06:44:24,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9451754385964912 [2025-03-04 06:44:24,409 INFO L175 Difference]: Start difference. First operand has 164 places, 190 transitions, 630 flow. Second operand 3 states and 431 transitions. [2025-03-04 06:44:24,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 199 transitions, 701 flow [2025-03-04 06:44:24,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 199 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:24,416 INFO L231 Difference]: Finished difference. Result has 168 places, 196 transitions, 682 flow [2025-03-04 06:44:24,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=168, PETRI_TRANSITIONS=196} [2025-03-04 06:44:24,417 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 17 predicate places. [2025-03-04 06:44:24,417 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 196 transitions, 682 flow [2025-03-04 06:44:24,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:24,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:24,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:24,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:44:24,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:24,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2125548182, now seen corresponding path program 1 times [2025-03-04 06:44:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:24,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420725090] [2025-03-04 06:44:24,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:24,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:24,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:44:24,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:44:24,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:24,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420725090] [2025-03-04 06:44:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420725090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:24,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:24,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439512883] [2025-03-04 06:44:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:24,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:24,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:24,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:24,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 152 [2025-03-04 06:44:24,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 196 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:24,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:24,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 152 [2025-03-04 06:44:24,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:26,010 INFO L124 PetriNetUnfolderBase]: 3408/12560 cut-off events. [2025-03-04 06:44:26,011 INFO L125 PetriNetUnfolderBase]: For 2980/3101 co-relation queries the response was YES. [2025-03-04 06:44:26,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24916 conditions, 12560 events. 3408/12560 cut-off events. For 2980/3101 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 132477 event pairs, 720 based on Foata normal form. 1/11372 useless extension candidates. Maximal degree in co-relation 21135. Up to 4279 conditions per place. [2025-03-04 06:44:26,090 INFO L140 encePairwiseOnDemand]: 129/152 looper letters, 95 selfloop transitions, 96 changer transitions 0/322 dead transitions. [2025-03-04 06:44:26,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 322 transitions, 1580 flow [2025-03-04 06:44:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2025-03-04 06:44:26,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2025-03-04 06:44:26,092 INFO L175 Difference]: Start difference. First operand has 168 places, 196 transitions, 682 flow. Second operand 6 states and 828 transitions. [2025-03-04 06:44:26,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 322 transitions, 1580 flow [2025-03-04 06:44:26,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 322 transitions, 1568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:44:26,110 INFO L231 Difference]: Finished difference. Result has 175 places, 290 transitions, 1466 flow [2025-03-04 06:44:26,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1466, PETRI_PLACES=175, PETRI_TRANSITIONS=290} [2025-03-04 06:44:26,111 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 24 predicate places. [2025-03-04 06:44:26,111 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 290 transitions, 1466 flow [2025-03-04 06:44:26,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:26,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:26,112 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] [2025-03-04 06:44:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:44:26,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:26,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1515492587, now seen corresponding path program 1 times [2025-03-04 06:44:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117562771] [2025-03-04 06:44:26,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:26,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:44:26,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:44:26,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:26,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117562771] [2025-03-04 06:44:26,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117562771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:26,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:26,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247098204] [2025-03-04 06:44:26,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:26,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:26,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:26,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:26,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 152 [2025-03-04 06:44:26,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 290 transitions, 1466 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:26,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:26,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 152 [2025-03-04 06:44:26,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:27,955 INFO L124 PetriNetUnfolderBase]: 4647/16996 cut-off events. [2025-03-04 06:44:27,956 INFO L125 PetriNetUnfolderBase]: For 11765/12572 co-relation queries the response was YES. [2025-03-04 06:44:28,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42398 conditions, 16996 events. 4647/16996 cut-off events. For 11765/12572 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 193283 event pairs, 1002 based on Foata normal form. 55/15414 useless extension candidates. Maximal degree in co-relation 35392. Up to 6497 conditions per place. [2025-03-04 06:44:28,144 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 147 selfloop transitions, 72 changer transitions 0/359 dead transitions. [2025-03-04 06:44:28,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 359 transitions, 2356 flow [2025-03-04 06:44:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2025-03-04 06:44:28,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831140350877193 [2025-03-04 06:44:28,147 INFO L175 Difference]: Start difference. First operand has 175 places, 290 transitions, 1466 flow. Second operand 6 states and 758 transitions. [2025-03-04 06:44:28,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 359 transitions, 2356 flow [2025-03-04 06:44:28,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 359 transitions, 2338 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:28,208 INFO L231 Difference]: Finished difference. Result has 185 places, 357 transitions, 2242 flow [2025-03-04 06:44:28,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=185, PETRI_TRANSITIONS=357} [2025-03-04 06:44:28,209 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 34 predicate places. [2025-03-04 06:44:28,209 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 357 transitions, 2242 flow [2025-03-04 06:44:28,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:28,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:28,210 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-03-04 06:44:28,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:44:28,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:28,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1713334603, now seen corresponding path program 1 times [2025-03-04 06:44:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197154751] [2025-03-04 06:44:28,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:28,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:44:28,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:44:28,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:28,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197154751] [2025-03-04 06:44:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197154751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:28,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:44:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561271069] [2025-03-04 06:44:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:28,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:44:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:28,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:44:28,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:44:28,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-03-04 06:44:28,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 357 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:28,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:28,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-03-04 06:44:28,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:29,753 INFO L124 PetriNetUnfolderBase]: 3744/14859 cut-off events. [2025-03-04 06:44:29,754 INFO L125 PetriNetUnfolderBase]: For 10964/11386 co-relation queries the response was YES. [2025-03-04 06:44:29,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36429 conditions, 14859 events. 3744/14859 cut-off events. For 10964/11386 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 169340 event pairs, 335 based on Foata normal form. 33/13736 useless extension candidates. Maximal degree in co-relation 31506. Up to 3119 conditions per place. [2025-03-04 06:44:29,821 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 16 selfloop transitions, 7 changer transitions 0/364 dead transitions. [2025-03-04 06:44:29,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 364 transitions, 2316 flow [2025-03-04 06:44:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:44:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:44:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2025-03-04 06:44:29,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364035087719298 [2025-03-04 06:44:29,822 INFO L175 Difference]: Start difference. First operand has 185 places, 357 transitions, 2242 flow. Second operand 3 states and 427 transitions. [2025-03-04 06:44:29,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 364 transitions, 2316 flow [2025-03-04 06:44:29,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 364 transitions, 2176 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:29,869 INFO L231 Difference]: Finished difference. Result has 189 places, 362 transitions, 2158 flow [2025-03-04 06:44:29,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2158, PETRI_PLACES=189, PETRI_TRANSITIONS=362} [2025-03-04 06:44:29,870 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 38 predicate places. [2025-03-04 06:44:29,870 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 362 transitions, 2158 flow [2025-03-04 06:44:29,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:29,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:29,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:29,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:44:29,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:29,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2009991199, now seen corresponding path program 1 times [2025-03-04 06:44:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:29,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286551785] [2025-03-04 06:44:29,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:29,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:29,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:44:29,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:44:29,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:29,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286551785] [2025-03-04 06:44:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286551785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:44:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839479153] [2025-03-04 06:44:30,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:44:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:30,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:44:30,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:44:30,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2025-03-04 06:44:30,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 362 transitions, 2158 flow. Second operand has 10 states, 10 states have (on average 113.7) internal successors, (1137), 10 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:30,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:30,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2025-03-04 06:44:30,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:33,001 INFO L124 PetriNetUnfolderBase]: 7013/22244 cut-off events. [2025-03-04 06:44:33,001 INFO L125 PetriNetUnfolderBase]: For 23509/24379 co-relation queries the response was YES. [2025-03-04 06:44:33,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66309 conditions, 22244 events. 7013/22244 cut-off events. For 23509/24379 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 256101 event pairs, 840 based on Foata normal form. 341/21161 useless extension candidates. Maximal degree in co-relation 59940. Up to 5002 conditions per place. [2025-03-04 06:44:33,147 INFO L140 encePairwiseOnDemand]: 133/152 looper letters, 327 selfloop transitions, 238 changer transitions 0/697 dead transitions. [2025-03-04 06:44:33,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 697 transitions, 5706 flow [2025-03-04 06:44:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:44:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:44:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1275 transitions. [2025-03-04 06:44:33,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388157894736842 [2025-03-04 06:44:33,151 INFO L175 Difference]: Start difference. First operand has 189 places, 362 transitions, 2158 flow. Second operand 10 states and 1275 transitions. [2025-03-04 06:44:33,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 697 transitions, 5706 flow [2025-03-04 06:44:33,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 697 transitions, 5692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:44:33,247 INFO L231 Difference]: Finished difference. Result has 203 places, 535 transitions, 4595 flow [2025-03-04 06:44:33,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4595, PETRI_PLACES=203, PETRI_TRANSITIONS=535} [2025-03-04 06:44:33,248 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 52 predicate places. [2025-03-04 06:44:33,248 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 535 transitions, 4595 flow [2025-03-04 06:44:33,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.7) internal successors, (1137), 10 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:33,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:33,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:33,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:44:33,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2114859934, now seen corresponding path program 1 times [2025-03-04 06:44:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103065869] [2025-03-04 06:44:33,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:33,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:44:33,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:44:33,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:33,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103065869] [2025-03-04 06:44:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103065869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:33,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:44:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591471679] [2025-03-04 06:44:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:33,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:44:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:33,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:44:33,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:44:34,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 152 [2025-03-04 06:44:34,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 535 transitions, 4595 flow. Second operand has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:34,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:34,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 152 [2025-03-04 06:44:34,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:36,785 INFO L124 PetriNetUnfolderBase]: 6452/21952 cut-off events. [2025-03-04 06:44:36,785 INFO L125 PetriNetUnfolderBase]: For 48229/49758 co-relation queries the response was YES. [2025-03-04 06:44:36,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75780 conditions, 21952 events. 6452/21952 cut-off events. For 48229/49758 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 257887 event pairs, 944 based on Foata normal form. 354/20525 useless extension candidates. Maximal degree in co-relation 71348. Up to 5177 conditions per place. [2025-03-04 06:44:36,960 INFO L140 encePairwiseOnDemand]: 142/152 looper letters, 476 selfloop transitions, 38 changer transitions 0/680 dead transitions. [2025-03-04 06:44:36,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 680 transitions, 7431 flow [2025-03-04 06:44:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:44:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:44:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1076 transitions. [2025-03-04 06:44:36,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865497076023392 [2025-03-04 06:44:36,962 INFO L175 Difference]: Start difference. First operand has 203 places, 535 transitions, 4595 flow. Second operand 9 states and 1076 transitions. [2025-03-04 06:44:36,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 680 transitions, 7431 flow [2025-03-04 06:44:37,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 680 transitions, 7394 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-03-04 06:44:37,350 INFO L231 Difference]: Finished difference. Result has 208 places, 534 transitions, 4638 flow [2025-03-04 06:44:37,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4638, PETRI_PLACES=208, PETRI_TRANSITIONS=534} [2025-03-04 06:44:37,351 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 57 predicate places. [2025-03-04 06:44:37,351 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 534 transitions, 4638 flow [2025-03-04 06:44:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:37,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:37,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:44:37,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:37,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1694897330, now seen corresponding path program 1 times [2025-03-04 06:44:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791371268] [2025-03-04 06:44:37,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:37,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:44:37,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:44:37,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:37,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:37,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791371268] [2025-03-04 06:44:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791371268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:37,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:37,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:44:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73425634] [2025-03-04 06:44:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:37,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:44:37,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:37,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:44:37,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:44:38,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 152 [2025-03-04 06:44:38,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 534 transitions, 4638 flow. Second operand has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:38,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:38,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 152 [2025-03-04 06:44:38,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:40,524 INFO L124 PetriNetUnfolderBase]: 6833/22456 cut-off events. [2025-03-04 06:44:40,524 INFO L125 PetriNetUnfolderBase]: For 53698/55038 co-relation queries the response was YES. [2025-03-04 06:44:40,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80182 conditions, 22456 events. 6833/22456 cut-off events. For 53698/55038 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 261063 event pairs, 1118 based on Foata normal form. 287/20934 useless extension candidates. Maximal degree in co-relation 75918. Up to 6626 conditions per place. [2025-03-04 06:44:40,675 INFO L140 encePairwiseOnDemand]: 142/152 looper letters, 500 selfloop transitions, 36 changer transitions 0/679 dead transitions. [2025-03-04 06:44:40,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 679 transitions, 7510 flow [2025-03-04 06:44:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:44:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:44:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1028 transitions. [2025-03-04 06:44:40,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7514619883040936 [2025-03-04 06:44:40,677 INFO L175 Difference]: Start difference. First operand has 208 places, 534 transitions, 4638 flow. Second operand 9 states and 1028 transitions. [2025-03-04 06:44:40,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 679 transitions, 7510 flow [2025-03-04 06:44:40,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 679 transitions, 7434 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:44:40,845 INFO L231 Difference]: Finished difference. Result has 207 places, 533 transitions, 4630 flow [2025-03-04 06:44:40,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4558, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4630, PETRI_PLACES=207, PETRI_TRANSITIONS=533} [2025-03-04 06:44:40,846 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 56 predicate places. [2025-03-04 06:44:40,846 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 533 transitions, 4630 flow [2025-03-04 06:44:40,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:40,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:40,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:40,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:44:40,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:40,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash 165654162, now seen corresponding path program 1 times [2025-03-04 06:44:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:40,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-03-04 06:44:40,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:40,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:44:40,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:44:40,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:40,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:41,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:41,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-03-04 06:44:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920125160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:41,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:41,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:41,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331195617] [2025-03-04 06:44:41,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:41,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:41,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:41,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:41,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 152 [2025-03-04 06:44:41,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 533 transitions, 4630 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:41,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:41,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 152 [2025-03-04 06:44:41,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:44,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][213], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), 264#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), 121#L706true, Black: 154#true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 162#true, 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 14#L695-4true, Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 173#true, Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-04 06:44:44,759 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2025-03-04 06:44:44,759 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-03-04 06:44:44,759 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-03-04 06:44:44,759 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L695-2-->L695: Formula: (= |v_#race~x~0_4| |v_thrThread2of2ForFork0_#t~nondet4_3|) InVars {thrThread2of2ForFork0_#t~nondet4=|v_thrThread2of2ForFork0_#t~nondet4_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thrThread2of2ForFork0_#t~nondet4=|v_thrThread2of2ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[#race~x~0][451], [Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 109#L713true, 152#true, 273#true, 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 39#L695true, 128#L695true, 188#true, Black: 154#true, 256#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 162#true, Black: 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 150#true, Black: 175#(= |#race~x~0| 0), Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-04 06:44:44,931 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L695-2-->L695: Formula: (= |v_thrThread1of2ForFork0_#t~nondet4_3| |v_#race~x~0_4|) InVars {thrThread1of2ForFork0_#t~nondet4=|v_thrThread1of2ForFork0_#t~nondet4_3|} OutVars{thrThread1of2ForFork0_#t~nondet4=|v_thrThread1of2ForFork0_#t~nondet4_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][478], [Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 199#true, 109#L713true, 152#true, 273#true, 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 39#L695true, 128#L695true, 188#true, Black: 154#true, 256#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 162#true, Black: 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 150#true, Black: 175#(= |#race~x~0| 0), Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-04 06:44:44,931 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-04 06:44:44,931 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-04 06:44:45,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L695-2-->L695: Formula: (= |v_#race~x~0_4| |v_thrThread2of2ForFork0_#t~nondet4_3|) InVars {thrThread2of2ForFork0_#t~nondet4=|v_thrThread2of2ForFork0_#t~nondet4_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thrThread2of2ForFork0_#t~nondet4=|v_thrThread2of2ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[#race~x~0][451], [Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 109#L713true, 152#true, 273#true, 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 39#L695true, 188#true, Black: 154#true, 256#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 162#true, Black: 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 150#true, Black: 175#(= |#race~x~0| 0), 5#L695-1true, Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-04 06:44:45,006 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2025-03-04 06:44:45,006 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-03-04 06:44:45,006 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-03-04 06:44:45,006 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-03-04 06:44:45,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([427] L695-2-->L695: Formula: (= |v_#race~x~0_4| |v_thrThread2of2ForFork0_#t~nondet4_3|) InVars {thrThread2of2ForFork0_#t~nondet4=|v_thrThread2of2ForFork0_#t~nondet4_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thrThread2of2ForFork0_#t~nondet4=|v_thrThread2of2ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[#race~x~0][450], [Black: 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 109#L713true, 152#true, 273#true, 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 39#L695true, 7#thrFINALtrue, 188#true, Black: 154#true, 256#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 162#true, Black: 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 150#true, Black: 175#(= |#race~x~0| 0), Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-04 06:44:45,099 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is not cut-off event [2025-03-04 06:44:45,099 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2025-03-04 06:44:45,099 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2025-03-04 06:44:45,099 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2025-03-04 06:44:45,763 INFO L124 PetriNetUnfolderBase]: 11962/32966 cut-off events. [2025-03-04 06:44:45,763 INFO L125 PetriNetUnfolderBase]: For 85559/86823 co-relation queries the response was YES. [2025-03-04 06:44:46,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120020 conditions, 32966 events. 11962/32966 cut-off events. For 85559/86823 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 375589 event pairs, 1364 based on Foata normal form. 29/30856 useless extension candidates. Maximal degree in co-relation 113901. Up to 14378 conditions per place. [2025-03-04 06:44:46,183 INFO L140 encePairwiseOnDemand]: 129/152 looper letters, 367 selfloop transitions, 354 changer transitions 0/890 dead transitions. [2025-03-04 06:44:46,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 890 transitions, 9346 flow [2025-03-04 06:44:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2025-03-04 06:44:46,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2025-03-04 06:44:46,185 INFO L175 Difference]: Start difference. First operand has 207 places, 533 transitions, 4630 flow. Second operand 6 states and 824 transitions. [2025-03-04 06:44:46,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 890 transitions, 9346 flow [2025-03-04 06:44:46,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 890 transitions, 9126 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:44:46,654 INFO L231 Difference]: Finished difference. Result has 208 places, 821 transitions, 8451 flow [2025-03-04 06:44:46,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4558, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8451, PETRI_PLACES=208, PETRI_TRANSITIONS=821} [2025-03-04 06:44:46,655 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 57 predicate places. [2025-03-04 06:44:46,655 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 821 transitions, 8451 flow [2025-03-04 06:44:46,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:46,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:46,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:46,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:44:46,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:46,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1145722874, now seen corresponding path program 1 times [2025-03-04 06:44:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132313502] [2025-03-04 06:44:46,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:46,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:44:46,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:44:46,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:46,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132313502] [2025-03-04 06:44:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132313502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:46,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:44:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713111264] [2025-03-04 06:44:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:46,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:44:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:46,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:44:46,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:44:46,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-03-04 06:44:46,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 821 transitions, 8451 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:46,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:46,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-03-04 06:44:46,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:49,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][217], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, 283#true, 56#L695-2true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 278#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 277#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 276#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 275#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), 121#L706true, Black: 154#true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 162#true, Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 173#true, Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-04 06:44:49,151 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-04 06:44:49,151 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-04 06:44:49,151 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-04 06:44:49,151 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-04 06:44:49,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][781], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 81#L695-1true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 278#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 277#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 276#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 275#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), 121#L706true, 285#(= |thrThread2of2ForFork0_#t~nondet4| |#race~x~0|), Black: 154#true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 162#true, Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 175#(= |#race~x~0| 0), Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-03-04 06:44:49,232 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-04 06:44:49,232 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-04 06:44:49,232 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-04 06:44:49,232 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-04 06:44:49,803 INFO L124 PetriNetUnfolderBase]: 10400/30712 cut-off events. [2025-03-04 06:44:49,804 INFO L125 PetriNetUnfolderBase]: For 87306/88929 co-relation queries the response was YES. [2025-03-04 06:44:50,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115632 conditions, 30712 events. 10400/30712 cut-off events. For 87306/88929 co-relation queries the response was YES. Maximal size of possible extension queue 1484. Compared 361691 event pairs, 742 based on Foata normal form. 69/29853 useless extension candidates. Maximal degree in co-relation 109255. Up to 7331 conditions per place. [2025-03-04 06:44:50,136 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 16 selfloop transitions, 9 changer transitions 0/827 dead transitions. [2025-03-04 06:44:50,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 827 transitions, 8526 flow [2025-03-04 06:44:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:44:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:44:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2025-03-04 06:44:50,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9342105263157895 [2025-03-04 06:44:50,137 INFO L175 Difference]: Start difference. First operand has 208 places, 821 transitions, 8451 flow. Second operand 3 states and 426 transitions. [2025-03-04 06:44:50,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 827 transitions, 8526 flow [2025-03-04 06:44:50,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 827 transitions, 8442 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:50,801 INFO L231 Difference]: Finished difference. Result has 212 places, 826 transitions, 8435 flow [2025-03-04 06:44:50,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=8367, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8435, PETRI_PLACES=212, PETRI_TRANSITIONS=826} [2025-03-04 06:44:50,802 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 61 predicate places. [2025-03-04 06:44:50,802 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 826 transitions, 8435 flow [2025-03-04 06:44:50,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:50,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:50,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:50,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:44:50,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:44:50,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1734156770, now seen corresponding path program 1 times [2025-03-04 06:44:50,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322838238] [2025-03-04 06:44:50,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:50,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 06:44:50,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 06:44:50,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:50,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:44:50,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:44:50,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 06:44:50,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 06:44:50,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:50,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:44:50,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:44:50,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:44:50,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 06:44:50,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-04 06:44:50,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-04 06:44:50,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:44:50,840 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:50,840 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:44:50,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:44:50,859 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:44:50,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 175 transitions, 377 flow [2025-03-04 06:44:50,888 INFO L124 PetriNetUnfolderBase]: 33/574 cut-off events. [2025-03-04 06:44:50,888 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-03-04 06:44:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 574 events. 33/574 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1981 event pairs, 1 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 337. Up to 16 conditions per place. [2025-03-04 06:44:50,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 175 transitions, 377 flow [2025-03-04 06:44:50,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 175 transitions, 377 flow [2025-03-04 06:44:50,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:44:50,895 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23f24b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:44:50,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 06:44:50,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:44:50,897 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-03-04 06:44:50,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:44:50,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:50,897 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] [2025-03-04 06:44:50,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:44:50,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -698795779, now seen corresponding path program 1 times [2025-03-04 06:44:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:50,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534923040] [2025-03-04 06:44:50,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:50,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:44:50,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:44:50,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:50,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534923040] [2025-03-04 06:44:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534923040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010209581] [2025-03-04 06:44:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:44:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:50,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:44:50,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:44:51,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 175 [2025-03-04 06:44:51,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 175 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:51,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:51,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 175 [2025-03-04 06:44:51,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:51,074 INFO L124 PetriNetUnfolderBase]: 25/757 cut-off events. [2025-03-04 06:44:51,074 INFO L125 PetriNetUnfolderBase]: For 67/104 co-relation queries the response was YES. [2025-03-04 06:44:51,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 757 events. 25/757 cut-off events. For 67/104 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3340 event pairs, 0 based on Foata normal form. 37/713 useless extension candidates. Maximal degree in co-relation 480. Up to 91 conditions per place. [2025-03-04 06:44:51,077 INFO L140 encePairwiseOnDemand]: 160/175 looper letters, 27 selfloop transitions, 9 changer transitions 4/187 dead transitions. [2025-03-04 06:44:51,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 187 transitions, 488 flow [2025-03-04 06:44:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:44:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:44:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2025-03-04 06:44:51,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171428571428571 [2025-03-04 06:44:51,078 INFO L175 Difference]: Start difference. First operand has 175 places, 175 transitions, 377 flow. Second operand 4 states and 642 transitions. [2025-03-04 06:44:51,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 187 transitions, 488 flow [2025-03-04 06:44:51,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 187 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:51,080 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 435 flow [2025-03-04 06:44:51,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2025-03-04 06:44:51,080 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 4 predicate places. [2025-03-04 06:44:51,081 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 435 flow [2025-03-04 06:44:51,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:51,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:51,081 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] [2025-03-04 06:44:51,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:44:51,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:44:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1024135242, now seen corresponding path program 1 times [2025-03-04 06:44:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282927808] [2025-03-04 06:44:51,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:51,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 06:44:51,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 06:44:51,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:51,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:51,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:51,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282927808] [2025-03-04 06:44:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282927808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:51,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325941177] [2025-03-04 06:44:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:51,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:51,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:51,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:51,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 175 [2025-03-04 06:44:51,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:51,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:51,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 175 [2025-03-04 06:44:51,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:53,251 INFO L124 PetriNetUnfolderBase]: 10841/30705 cut-off events. [2025-03-04 06:44:53,252 INFO L125 PetriNetUnfolderBase]: For 3471/3595 co-relation queries the response was YES. [2025-03-04 06:44:53,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49795 conditions, 30705 events. 10841/30705 cut-off events. For 3471/3595 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 345172 event pairs, 8007 based on Foata normal form. 0/27748 useless extension candidates. Maximal degree in co-relation 21955. Up to 15381 conditions per place. [2025-03-04 06:44:53,390 INFO L140 encePairwiseOnDemand]: 156/175 looper letters, 52 selfloop transitions, 54 changer transitions 0/231 dead transitions. [2025-03-04 06:44:53,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 231 transitions, 769 flow [2025-03-04 06:44:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2025-03-04 06:44:53,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8114285714285714 [2025-03-04 06:44:53,395 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 435 flow. Second operand 6 states and 852 transitions. [2025-03-04 06:44:53,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 231 transitions, 769 flow [2025-03-04 06:44:53,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 231 transitions, 767 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:53,401 INFO L231 Difference]: Finished difference. Result has 188 places, 229 transitions, 791 flow [2025-03-04 06:44:53,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=188, PETRI_TRANSITIONS=229} [2025-03-04 06:44:53,402 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 13 predicate places. [2025-03-04 06:44:53,402 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 229 transitions, 791 flow [2025-03-04 06:44:53,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:53,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:53,403 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] [2025-03-04 06:44:53,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:44:53,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:44:53,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1544316823, now seen corresponding path program 1 times [2025-03-04 06:44:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723907845] [2025-03-04 06:44:53,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 06:44:53,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 06:44:53,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:53,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723907845] [2025-03-04 06:44:53,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723907845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:53,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:53,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:44:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145620611] [2025-03-04 06:44:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:53,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:44:53,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:53,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:44:53,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:44:53,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 175 [2025-03-04 06:44:53,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 229 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:53,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:53,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 175 [2025-03-04 06:44:53,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:56,163 INFO L124 PetriNetUnfolderBase]: 9552/38565 cut-off events. [2025-03-04 06:44:56,164 INFO L125 PetriNetUnfolderBase]: For 7557/7940 co-relation queries the response was YES. [2025-03-04 06:44:56,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65260 conditions, 38565 events. 9552/38565 cut-off events. For 7557/7940 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 517497 event pairs, 2680 based on Foata normal form. 1/34868 useless extension candidates. Maximal degree in co-relation 54647. Up to 9627 conditions per place. [2025-03-04 06:44:56,569 INFO L140 encePairwiseOnDemand]: 163/175 looper letters, 23 selfloop transitions, 9 changer transitions 0/243 dead transitions. [2025-03-04 06:44:56,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 243 transitions, 904 flow [2025-03-04 06:44:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:44:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:44:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-03-04 06:44:56,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940952380952381 [2025-03-04 06:44:56,571 INFO L175 Difference]: Start difference. First operand has 188 places, 229 transitions, 791 flow. Second operand 3 states and 494 transitions. [2025-03-04 06:44:56,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 243 transitions, 904 flow [2025-03-04 06:44:56,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 243 transitions, 904 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:56,642 INFO L231 Difference]: Finished difference. Result has 192 places, 238 transitions, 869 flow [2025-03-04 06:44:56,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=192, PETRI_TRANSITIONS=238} [2025-03-04 06:44:56,642 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 17 predicate places. [2025-03-04 06:44:56,642 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 238 transitions, 869 flow [2025-03-04 06:44:56,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:56,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:56,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:44:56,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:44:56,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:56,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1791553381, now seen corresponding path program 1 times [2025-03-04 06:44:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:56,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-03-04 06:44:56,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:56,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:44:56,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:44:56,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:56,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121043263] [2025-03-04 06:44:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121043263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453445260] [2025-03-04 06:44:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:56,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:56,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:56,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:56,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 175 [2025-03-04 06:44:56,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 238 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:44:56,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:56,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 175 [2025-03-04 06:44:56,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:03,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][328], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 130#L694-4true, Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 172#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 197#true, 186#true, 95#L694-1true, 174#true, Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 199#(= |#race~x~0| 0), Black: 180#(= |ULTIMATE.start_main_~i~0#1| 0), 176#true, 126#L703-3true, 202#true, 55#L695true, 178#true]) [2025-03-04 06:45:03,590 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-03-04 06:45:03,590 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:45:03,590 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:45:03,590 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:45:12,088 INFO L124 PetriNetUnfolderBase]: 55899/177210 cut-off events. [2025-03-04 06:45:12,088 INFO L125 PetriNetUnfolderBase]: For 44248/46285 co-relation queries the response was YES. [2025-03-04 06:45:12,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351483 conditions, 177210 events. 55899/177210 cut-off events. For 44248/46285 co-relation queries the response was YES. Maximal size of possible extension queue 3880. Compared 2650537 event pairs, 14629 based on Foata normal form. 45/160191 useless extension candidates. Maximal degree in co-relation 299343. Up to 56951 conditions per place. [2025-03-04 06:45:13,389 INFO L140 encePairwiseOnDemand]: 148/175 looper letters, 137 selfloop transitions, 128 changer transitions 0/416 dead transitions. [2025-03-04 06:45:13,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 416 transitions, 2203 flow [2025-03-04 06:45:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 960 transitions. [2025-03-04 06:45:13,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2025-03-04 06:45:13,390 INFO L175 Difference]: Start difference. First operand has 192 places, 238 transitions, 869 flow. Second operand 6 states and 960 transitions. [2025-03-04 06:45:13,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 416 transitions, 2203 flow [2025-03-04 06:45:13,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 416 transitions, 2185 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:45:13,814 INFO L231 Difference]: Finished difference. Result has 199 places, 366 transitions, 1994 flow [2025-03-04 06:45:13,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1994, PETRI_PLACES=199, PETRI_TRANSITIONS=366} [2025-03-04 06:45:13,814 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 24 predicate places. [2025-03-04 06:45:13,814 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 366 transitions, 1994 flow [2025-03-04 06:45:13,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:13,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:13,815 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] [2025-03-04 06:45:13,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:45:13,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-04 06:45:13,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 291678373, now seen corresponding path program 1 times [2025-03-04 06:45:13,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:13,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28661294] [2025-03-04 06:45:13,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:13,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:45:13,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:45:13,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:13,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28661294] [2025-03-04 06:45:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28661294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:13,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:13,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:13,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755177271] [2025-03-04 06:45:13,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:13,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:13,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:13,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:13,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:14,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 175 [2025-03-04 06:45:14,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 366 transitions, 1994 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:45:14,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:14,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 175 [2025-03-04 06:45:14,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:16,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][323], [130#L694-4true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 172#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 197#true, 186#true, 174#true, 95#L694-1true, 167#L694-4true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 180#(= |ULTIMATE.start_main_~i~0#1| 0), 176#true, 121#L702-1true, 202#true, 212#true, 178#true]) [2025-03-04 06:45:16,959 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-04 06:45:16,959 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-04 06:45:16,959 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-04 06:45:16,959 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-04 06:45:18,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][323], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 130#L694-4true, Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 172#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 197#true, 186#true, 174#true, 95#L694-1true, 167#L694-4true, 136#L705true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 180#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 178#true, 176#true, 202#true, 212#true]) [2025-03-04 06:45:18,796 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-04 06:45:18,796 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-04 06:45:18,796 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-04 06:45:18,797 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-04 06:45:20,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][370], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 130#L694-4true, Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 172#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 197#true, 186#true, 174#true, 95#L694-1true, 167#L694-4true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 180#(= |ULTIMATE.start_main_~i~0#1| 0), 176#true, 126#L703-3true, 202#true, 212#true, 178#true]) [2025-03-04 06:45:20,313 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,313 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,313 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,313 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][426], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 130#L694-4true, Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 172#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 197#true, 186#true, 95#L694-1true, 174#true, 52#L694-3true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), 49#L706-1true, Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), 180#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 178#true, 176#true, 202#true, 212#true]) [2025-03-04 06:45:20,530 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,530 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,530 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,530 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:45:20,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][323], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 130#L694-4true, Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 172#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 197#true, 186#true, 174#true, 95#L694-1true, 167#L694-4true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), 147#L709true, Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), Black: 180#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 178#true, 176#true, 202#true, 212#true]) [2025-03-04 06:45:20,624 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-03-04 06:45:20,624 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-04 06:45:20,624 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-04 06:45:20,624 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-04 06:45:21,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L694-5-->L694-4: Formula: (= (store |v_#race_40| |v_~#a~0.base_24| (store (select |v_#race_40| |v_~#a~0.base_24|) (+ |v_~#a~0.offset_24| (* 4 v_thrThread3of3ForFork0_~t~0_5)) |v_thrThread3of3ForFork0_#t~nondet3_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} OutVars{#race=|v_#race_39|, ~#a~0.base=|v_~#a~0.base_24|, ~#a~0.offset=|v_~#a~0.offset_24|, thrThread3of3ForFork0_~t~0=v_thrThread3of3ForFork0_~t~0_5, thrThread3of3ForFork0_#t~nondet3=|v_thrThread3of3ForFork0_#t~nondet3_3|} AuxVars[] AssignedVars[#race][370], [Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 130#L694-4true, Black: 190#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 172#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 197#true, 186#true, 174#true, 95#L694-1true, 52#L694-3true, Black: 205#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 207#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 3 |~#a~0.offset|)))), Black: 206#(and (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) 2 |~#a~0.offset|))) (= |thrThread1of3ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|)), Black: 204#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of3ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of3ForFork0_#t~nondet3|), Black: 182#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 180#(= |ULTIMATE.start_main_~i~0#1| 0), 176#true, 126#L703-3true, 202#true, 178#true, 212#true]) [2025-03-04 06:45:21,017 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-03-04 06:45:21,017 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:45:21,017 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:45:21,017 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event