./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/weaver/popl20-more-vector-add.wvr.c -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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:14:38,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:14:38,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:14:38,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:14:38,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:14:38,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:14:38,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:14:38,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:14:38,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:14:38,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:14:38,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:14:38,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:14:38,224 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:14:38,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:38,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:14:38,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:14:38,226 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-03-17 11:14:38,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:14:38,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:14:38,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:14:38,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:14:38,452 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:14:38,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-17 11:14:39,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab29d99/1e201d0c30324def98988c3b27f3efbf/FLAG2d4a7ae08 [2025-03-17 11:14:39,823 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:14:39,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-17 11:14:39,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab29d99/1e201d0c30324def98988c3b27f3efbf/FLAG2d4a7ae08 [2025-03-17 11:14:40,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fab29d99/1e201d0c30324def98988c3b27f3efbf [2025-03-17 11:14:40,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:14:40,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:14:40,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:40,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:14:40,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:14:40,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d36fc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40, skipping insertion in model container [2025-03-17 11:14:40,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:14:40,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:40,333 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:14:40,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:14:40,366 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:14:40,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40 WrapperNode [2025-03-17 11:14:40,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:14:40,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:40,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:14:40,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:14:40,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,415 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 265 [2025-03-17 11:14:40,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:14:40,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:14:40,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:14:40,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:14:40,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:14:40,468 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:14:40,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:14:40,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:14:40,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (1/1) ... [2025-03-17 11:14:40,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:14:40,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:14:40,496 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-17 11:14:40,499 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-17 11:14:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:14:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:14:40,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:14:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:14:40,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:14:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:14:40,518 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:14:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:14:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:14:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:14:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:14:40,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:14:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:14:40,519 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:14:40,616 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:14:40,617 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:14:41,170 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:14:41,171 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:14:41,191 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:14:41,193 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:14:41,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:41 BoogieIcfgContainer [2025-03-17 11:14:41,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:14:41,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:14:41,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:14:41,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:14:41,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:14:40" (1/3) ... [2025-03-17 11:14:41,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c15f082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:41, skipping insertion in model container [2025-03-17 11:14:41,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:14:40" (2/3) ... [2025-03-17 11:14:41,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c15f082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:14:41, skipping insertion in model container [2025-03-17 11:14:41,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:14:41" (3/3) ... [2025-03-17 11:14:41,202 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-03-17 11:14:41,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:14:41,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 7 loop locations, and 44 error locations. [2025-03-17 11:14:41,213 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:14:41,339 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:14:41,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 506 transitions, 1033 flow [2025-03-17 11:14:41,518 INFO L124 PetriNetUnfolderBase]: 23/503 cut-off events. [2025-03-17 11:14:41,521 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:14:41,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 503 events. 23/503 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 752 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 392. Up to 2 conditions per place. [2025-03-17 11:14:41,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 506 transitions, 1033 flow [2025-03-17 11:14:41,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 472 places, 484 transitions, 986 flow [2025-03-17 11:14:41,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:14:41,549 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;@a9ba0ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:14:41,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-03-17 11:14:41,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:14:41,561 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-17 11:14:41,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:14:41,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:41,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:41,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:41,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash 579633619, now seen corresponding path program 1 times [2025-03-17 11:14:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:41,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543531572] [2025-03-17 11:14:41,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:41,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:14:41,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:14:41,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:41,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:41,695 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-17 11:14:41,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:41,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543531572] [2025-03-17 11:14:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543531572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:41,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:41,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836545673] [2025-03-17 11:14:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:41,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:41,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:41,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:41,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 506 [2025-03-17 11:14:41,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 484 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-17 11:14:41,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:41,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 506 [2025-03-17 11:14:41,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:41,917 INFO L124 PetriNetUnfolderBase]: 23/763 cut-off events. [2025-03-17 11:14:41,917 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-17 11:14:41,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 763 events. 23/763 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2653 event pairs, 7 based on Foata normal form. 22/669 useless extension candidates. Maximal degree in co-relation 423. Up to 31 conditions per place. [2025-03-17 11:14:41,926 INFO L140 encePairwiseOnDemand]: 490/506 looper letters, 13 selfloop transitions, 2 changer transitions 10/470 dead transitions. [2025-03-17 11:14:41,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 470 transitions, 988 flow [2025-03-17 11:14:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-17 11:14:41,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.955862977602108 [2025-03-17 11:14:41,943 INFO L175 Difference]: Start difference. First operand has 472 places, 484 transitions, 986 flow. Second operand 3 states and 1451 transitions. [2025-03-17 11:14:41,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 470 transitions, 988 flow [2025-03-17 11:14:41,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 470 transitions, 976 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:14:41,960 INFO L231 Difference]: Finished difference. Result has 467 places, 460 transitions, 930 flow [2025-03-17 11:14:41,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=467, PETRI_TRANSITIONS=460} [2025-03-17 11:14:41,965 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -5 predicate places. [2025-03-17 11:14:41,967 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 460 transitions, 930 flow [2025-03-17 11:14:41,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-17 11:14:41,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:41,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:41,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:14:41,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1712218733, now seen corresponding path program 1 times [2025-03-17 11:14:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684140143] [2025-03-17 11:14:41,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:41,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:14:41,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:14:41,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:41,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:42,026 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-17 11:14:42,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684140143] [2025-03-17 11:14:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684140143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:42,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:42,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197252820] [2025-03-17 11:14:42,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:42,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:42,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:42,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:42,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 506 [2025-03-17 11:14:42,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 460 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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-17 11:14:42,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:42,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 506 [2025-03-17 11:14:42,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:42,150 INFO L124 PetriNetUnfolderBase]: 17/604 cut-off events. [2025-03-17 11:14:42,150 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:14:42,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 604 events. 17/604 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1648 event pairs, 5 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 615. Up to 31 conditions per place. [2025-03-17 11:14:42,155 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 17 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-03-17 11:14:42,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 459 transitions, 966 flow [2025-03-17 11:14:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1430 transitions. [2025-03-17 11:14:42,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2025-03-17 11:14:42,160 INFO L175 Difference]: Start difference. First operand has 467 places, 460 transitions, 930 flow. Second operand 3 states and 1430 transitions. [2025-03-17 11:14:42,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 459 transitions, 966 flow [2025-03-17 11:14:42,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 459 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:42,170 INFO L231 Difference]: Finished difference. Result has 456 places, 459 transitions, 928 flow [2025-03-17 11:14:42,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=459} [2025-03-17 11:14:42,173 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2025-03-17 11:14:42,173 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 459 transitions, 928 flow [2025-03-17 11:14:42,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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-17 11:14:42,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:42,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:42,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:14:42,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash 456674265, now seen corresponding path program 1 times [2025-03-17 11:14:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043529508] [2025-03-17 11:14:42,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:42,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:14:42,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:14:42,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:42,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:42,207 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-17 11:14:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:42,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043529508] [2025-03-17 11:14:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043529508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:42,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:42,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774409961] [2025-03-17 11:14:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:42,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:42,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:42,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:42,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 506 [2025-03-17 11:14:42,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 459 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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-17 11:14:42,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:42,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 506 [2025-03-17 11:14:42,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:42,380 INFO L124 PetriNetUnfolderBase]: 29/735 cut-off events. [2025-03-17 11:14:42,381 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:14:42,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 735 events. 29/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2631 event pairs, 12 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 763. Up to 54 conditions per place. [2025-03-17 11:14:42,387 INFO L140 encePairwiseOnDemand]: 497/506 looper letters, 22 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2025-03-17 11:14:42,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 958 flow [2025-03-17 11:14:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2025-03-17 11:14:42,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9295125164690382 [2025-03-17 11:14:42,391 INFO L175 Difference]: Start difference. First operand has 456 places, 459 transitions, 928 flow. Second operand 3 states and 1411 transitions. [2025-03-17 11:14:42,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 958 flow [2025-03-17 11:14:42,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:42,396 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2025-03-17 11:14:42,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2025-03-17 11:14:42,398 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2025-03-17 11:14:42,398 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2025-03-17 11:14:42,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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-17 11:14:42,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:42,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:42,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:14:42,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:42,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash 923039052, now seen corresponding path program 1 times [2025-03-17 11:14:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961513495] [2025-03-17 11:14:42,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:42,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:14:42,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:14:42,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:42,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:42,937 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-17 11:14:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:42,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961513495] [2025-03-17 11:14:42,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961513495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:42,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:42,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946094867] [2025-03-17 11:14:42,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:42,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:42,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:42,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:43,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 506 [2025-03-17 11:14:43,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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-17 11:14:43,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:43,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 506 [2025-03-17 11:14:43,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:45,749 INFO L124 PetriNetUnfolderBase]: 5286/18348 cut-off events. [2025-03-17 11:14:45,751 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2025-03-17 11:14:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26429 conditions, 18348 events. 5286/18348 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 207448 event pairs, 4536 based on Foata normal form. 0/15640 useless extension candidates. Maximal degree in co-relation 26391. Up to 7875 conditions per place. [2025-03-17 11:14:45,869 INFO L140 encePairwiseOnDemand]: 482/506 looper letters, 82 selfloop transitions, 20 changer transitions 0/447 dead transitions. [2025-03-17 11:14:45,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 447 transitions, 1106 flow [2025-03-17 11:14:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2416 transitions. [2025-03-17 11:14:45,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7957839262187089 [2025-03-17 11:14:45,874 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2416 transitions. [2025-03-17 11:14:45,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 447 transitions, 1106 flow [2025-03-17 11:14:45,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:45,880 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 941 flow [2025-03-17 11:14:45,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2025-03-17 11:14:45,882 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2025-03-17 11:14:45,882 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 941 flow [2025-03-17 11:14:45,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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-17 11:14:45,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:45,883 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] [2025-03-17 11:14:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:14:45,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1640884646, now seen corresponding path program 1 times [2025-03-17 11:14:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620683831] [2025-03-17 11:14:45,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:45,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 11:14:45,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:14:45,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:45,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:45,922 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-17 11:14:45,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:45,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620683831] [2025-03-17 11:14:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620683831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:45,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744107755] [2025-03-17 11:14:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:45,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:45,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:45,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-17 11:14:45,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:45,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:45,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-17 11:14:45,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:45,999 INFO L124 PetriNetUnfolderBase]: 28/674 cut-off events. [2025-03-17 11:14:45,999 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:14:46,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 674 events. 28/674 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2254 event pairs, 15 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 707. Up to 40 conditions per place. [2025-03-17 11:14:46,004 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-03-17 11:14:46,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 446 transitions, 967 flow [2025-03-17 11:14:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-03-17 11:14:46,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-03-17 11:14:46,007 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 941 flow. Second operand 3 states and 1440 transitions. [2025-03-17 11:14:46,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 446 transitions, 967 flow [2025-03-17 11:14:46,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 446 transitions, 927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:46,018 INFO L231 Difference]: Finished difference. Result has 444 places, 446 transitions, 903 flow [2025-03-17 11:14:46,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=444, PETRI_TRANSITIONS=446} [2025-03-17 11:14:46,020 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -28 predicate places. [2025-03-17 11:14:46,021 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 446 transitions, 903 flow [2025-03-17 11:14:46,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:46,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:14:46,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:46,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash 344053223, now seen corresponding path program 1 times [2025-03-17 11:14:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658474831] [2025-03-17 11:14:46,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:46,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 11:14:46,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 11:14:46,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:46,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:46,074 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-17 11:14:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:46,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658474831] [2025-03-17 11:14:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658474831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:46,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903797087] [2025-03-17 11:14:46,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:46,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:46,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:46,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:46,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-17 11:14:46,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 446 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:46,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:46,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-17 11:14:46,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:46,188 INFO L124 PetriNetUnfolderBase]: 28/673 cut-off events. [2025-03-17 11:14:46,188 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:14:46,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 673 events. 28/673 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2214 event pairs, 15 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 688. Up to 40 conditions per place. [2025-03-17 11:14:46,191 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-03-17 11:14:46,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 929 flow [2025-03-17 11:14:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-03-17 11:14:46,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-03-17 11:14:46,194 INFO L175 Difference]: Start difference. First operand has 444 places, 446 transitions, 903 flow. Second operand 3 states and 1440 transitions. [2025-03-17 11:14:46,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 929 flow [2025-03-17 11:14:46,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 445 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:46,201 INFO L231 Difference]: Finished difference. Result has 443 places, 445 transitions, 901 flow [2025-03-17 11:14:46,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=443, PETRI_TRANSITIONS=445} [2025-03-17 11:14:46,202 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -29 predicate places. [2025-03-17 11:14:46,202 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 445 transitions, 901 flow [2025-03-17 11:14:46,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:46,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:46,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:46,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:14:46,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:46,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:46,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1083624630, now seen corresponding path program 1 times [2025-03-17 11:14:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530739721] [2025-03-17 11:14:46,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:46,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 11:14:46,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 11:14:46,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:46,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:46,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:46,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530739721] [2025-03-17 11:14:46,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530739721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:46,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:46,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:46,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409690982] [2025-03-17 11:14:46,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:46,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:46,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:46,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:46,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:46,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 506 [2025-03-17 11:14:46,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 445 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-17 11:14:46,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:46,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 506 [2025-03-17 11:14:46,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:46,305 INFO L124 PetriNetUnfolderBase]: 13/551 cut-off events. [2025-03-17 11:14:46,306 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:14:46,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 551 events. 13/551 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1300 event pairs, 2 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 540. Up to 16 conditions per place. [2025-03-17 11:14:46,308 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 11 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-03-17 11:14:46,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 444 transitions, 925 flow [2025-03-17 11:14:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1442 transitions. [2025-03-17 11:14:46,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499341238471674 [2025-03-17 11:14:46,311 INFO L175 Difference]: Start difference. First operand has 443 places, 445 transitions, 901 flow. Second operand 3 states and 1442 transitions. [2025-03-17 11:14:46,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 444 transitions, 925 flow [2025-03-17 11:14:46,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 444 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:46,316 INFO L231 Difference]: Finished difference. Result has 442 places, 444 transitions, 899 flow [2025-03-17 11:14:46,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=442, PETRI_TRANSITIONS=444} [2025-03-17 11:14:46,317 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -30 predicate places. [2025-03-17 11:14:46,317 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 444 transitions, 899 flow [2025-03-17 11:14:46,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-17 11:14:46,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:46,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:46,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:14:46,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:46,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1799564206, now seen corresponding path program 1 times [2025-03-17 11:14:46,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:46,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281748209] [2025-03-17 11:14:46,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:46,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 11:14:46,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 11:14:46,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:46,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:46,379 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-17 11:14:46,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:46,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281748209] [2025-03-17 11:14:46,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281748209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:46,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:46,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:46,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632507416] [2025-03-17 11:14:46,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:46,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:46,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:46,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:46,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-17 11:14:46,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:46,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:46,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-17 11:14:46,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:46,435 INFO L124 PetriNetUnfolderBase]: 17/506 cut-off events. [2025-03-17 11:14:46,435 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:14:46,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 506 events. 17/506 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1054 event pairs, 7 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 504. Up to 26 conditions per place. [2025-03-17 11:14:46,438 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-17 11:14:46,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 443 transitions, 925 flow [2025-03-17 11:14:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-03-17 11:14:46,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-03-17 11:14:46,442 INFO L175 Difference]: Start difference. First operand has 442 places, 444 transitions, 899 flow. Second operand 3 states and 1440 transitions. [2025-03-17 11:14:46,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 443 transitions, 925 flow [2025-03-17 11:14:46,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 443 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:46,448 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 897 flow [2025-03-17 11:14:46,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2025-03-17 11:14:46,451 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -31 predicate places. [2025-03-17 11:14:46,451 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 897 flow [2025-03-17 11:14:46,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:46,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:46,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:46,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:14:46,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2064652665, now seen corresponding path program 1 times [2025-03-17 11:14:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481992766] [2025-03-17 11:14:46,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:46,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:46,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 11:14:46,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 11:14:46,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:46,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:46,509 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-17 11:14:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:46,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481992766] [2025-03-17 11:14:46,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481992766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:46,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374120912] [2025-03-17 11:14:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:46,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:46,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:46,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:46,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 506 [2025-03-17 11:14:46,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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-17 11:14:46,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:46,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 506 [2025-03-17 11:14:46,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:46,591 INFO L124 PetriNetUnfolderBase]: 41/877 cut-off events. [2025-03-17 11:14:46,592 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-17 11:14:46,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 877 events. 41/877 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3798 event pairs, 20 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 906. Up to 56 conditions per place. [2025-03-17 11:14:46,597 INFO L140 encePairwiseOnDemand]: 501/506 looper letters, 14 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2025-03-17 11:14:46,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 439 transitions, 919 flow [2025-03-17 11:14:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-03-17 11:14:46,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453227931488801 [2025-03-17 11:14:46,601 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 897 flow. Second operand 3 states and 1435 transitions. [2025-03-17 11:14:46,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 439 transitions, 919 flow [2025-03-17 11:14:46,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 439 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:46,606 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 887 flow [2025-03-17 11:14:46,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-17 11:14:46,608 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-17 11:14:46,608 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 887 flow [2025-03-17 11:14:46,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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-17 11:14:46,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:46,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:46,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:14:46,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:46,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1995612877, now seen corresponding path program 1 times [2025-03-17 11:14:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:46,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884945060] [2025-03-17 11:14:46,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:46,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 11:14:46,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 11:14:46,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:46,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:46,672 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-17 11:14:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884945060] [2025-03-17 11:14:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884945060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:46,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:46,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:46,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051133803] [2025-03-17 11:14:46,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:46,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:46,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:46,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 506 [2025-03-17 11:14:46,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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-17 11:14:46,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:46,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 506 [2025-03-17 11:14:46,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:46,759 INFO L124 PetriNetUnfolderBase]: 17/558 cut-off events. [2025-03-17 11:14:46,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:14:46,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 558 events. 17/558 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1278 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 558. Up to 19 conditions per place. [2025-03-17 11:14:46,762 INFO L140 encePairwiseOnDemand]: 502/506 looper letters, 16 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-03-17 11:14:46,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 444 transitions, 938 flow [2025-03-17 11:14:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1454 transitions. [2025-03-17 11:14:46,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578392621870883 [2025-03-17 11:14:46,766 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 887 flow. Second operand 3 states and 1454 transitions. [2025-03-17 11:14:46,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 444 transitions, 938 flow [2025-03-17 11:14:46,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 937 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:14:46,773 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 896 flow [2025-03-17 11:14:46,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-17 11:14:46,776 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-17 11:14:46,776 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 896 flow [2025-03-17 11:14:46,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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-17 11:14:46,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:46,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:46,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:14:46,777 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:46,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2066438196, now seen corresponding path program 1 times [2025-03-17 11:14:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:46,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012859512] [2025-03-17 11:14:46,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 11:14:46,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 11:14:46,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:46,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:46,835 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-17 11:14:46,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:46,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012859512] [2025-03-17 11:14:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012859512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:46,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722004900] [2025-03-17 11:14:46,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:46,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:46,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:46,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:46,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-17 11:14:46,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:46,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:46,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-17 11:14:46,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:47,004 INFO L124 PetriNetUnfolderBase]: 135/1964 cut-off events. [2025-03-17 11:14:47,004 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2025-03-17 11:14:47,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 1964 events. 135/1964 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13291 event pairs, 36 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2150. Up to 187 conditions per place. [2025-03-17 11:14:47,015 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 18 selfloop transitions, 3 changer transitions 0/444 dead transitions. [2025-03-17 11:14:47,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 953 flow [2025-03-17 11:14:47,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2025-03-17 11:14:47,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2025-03-17 11:14:47,018 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 896 flow. Second operand 3 states and 1449 transitions. [2025-03-17 11:14:47,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 953 flow [2025-03-17 11:14:47,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 953 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:47,023 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 911 flow [2025-03-17 11:14:47,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=911, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-17 11:14:47,024 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-17 11:14:47,024 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 911 flow [2025-03-17 11:14:47,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-17 11:14:47,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:47,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:47,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:14:47,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:47,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2140488750, now seen corresponding path program 1 times [2025-03-17 11:14:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918982625] [2025-03-17 11:14:47,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 11:14:47,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 11:14:47,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:47,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:47,077 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-17 11:14:47,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918982625] [2025-03-17 11:14:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918982625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:47,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:47,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032644496] [2025-03-17 11:14:47,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:47,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:47,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:47,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:47,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-17 11:14:47,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-17 11:14:47,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:47,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-17 11:14:47,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:47,316 INFO L124 PetriNetUnfolderBase]: 149/1734 cut-off events. [2025-03-17 11:14:47,316 INFO L125 PetriNetUnfolderBase]: For 50/54 co-relation queries the response was YES. [2025-03-17 11:14:47,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1734 events. 149/1734 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10840 event pairs, 22 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 1977. Up to 170 conditions per place. [2025-03-17 11:14:47,325 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 17 selfloop transitions, 3 changer transitions 0/443 dead transitions. [2025-03-17 11:14:47,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 443 transitions, 963 flow [2025-03-17 11:14:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1448 transitions. [2025-03-17 11:14:47,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538866930171278 [2025-03-17 11:14:47,329 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 911 flow. Second operand 3 states and 1448 transitions. [2025-03-17 11:14:47,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 443 transitions, 963 flow [2025-03-17 11:14:47,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:47,333 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 926 flow [2025-03-17 11:14:47,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-17 11:14:47,335 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-17 11:14:47,335 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 926 flow [2025-03-17 11:14:47,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-17 11:14:47,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:47,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:47,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:14:47,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:47,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash -384546409, now seen corresponding path program 1 times [2025-03-17 11:14:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:47,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006518208] [2025-03-17 11:14:47,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:47,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 11:14:47,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 11:14:47,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:47,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:47,531 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-17 11:14:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006518208] [2025-03-17 11:14:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006518208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:47,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:14:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750126524] [2025-03-17 11:14:47,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:47,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:14:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:47,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:14:47,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:14:47,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 506 [2025-03-17 11:14:47,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 926 flow. Second operand has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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-17 11:14:47,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:47,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 506 [2025-03-17 11:14:47,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:48,066 INFO L124 PetriNetUnfolderBase]: 87/1593 cut-off events. [2025-03-17 11:14:48,067 INFO L125 PetriNetUnfolderBase]: For 11/34 co-relation queries the response was YES. [2025-03-17 11:14:48,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1593 events. 87/1593 cut-off events. For 11/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7166 event pairs, 20 based on Foata normal form. 5/1495 useless extension candidates. Maximal degree in co-relation 1873. Up to 76 conditions per place. [2025-03-17 11:14:48,076 INFO L140 encePairwiseOnDemand]: 469/506 looper letters, 49 selfloop transitions, 56 changer transitions 0/496 dead transitions. [2025-03-17 11:14:48,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 496 transitions, 1258 flow [2025-03-17 11:14:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:14:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:14:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4536 transitions. [2025-03-17 11:14:48,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964426877470356 [2025-03-17 11:14:48,082 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 926 flow. Second operand 10 states and 4536 transitions. [2025-03-17 11:14:48,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 496 transitions, 1258 flow [2025-03-17 11:14:48,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 496 transitions, 1258 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:48,088 INFO L231 Difference]: Finished difference. Result has 450 places, 473 transitions, 1181 flow [2025-03-17 11:14:48,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1181, PETRI_PLACES=450, PETRI_TRANSITIONS=473} [2025-03-17 11:14:48,089 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -22 predicate places. [2025-03-17 11:14:48,089 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 473 transitions, 1181 flow [2025-03-17 11:14:48,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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-17 11:14:48,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:48,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:48,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:14:48,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:48,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash -42590830, now seen corresponding path program 1 times [2025-03-17 11:14:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:48,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967386594] [2025-03-17 11:14:48,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:48,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 11:14:48,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 11:14:48,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:48,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:48,224 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-17 11:14:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967386594] [2025-03-17 11:14:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967386594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755173144] [2025-03-17 11:14:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:14:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:48,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:14:48,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:14:48,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 506 [2025-03-17 11:14:48,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 473 transitions, 1181 flow. Second operand has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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-17 11:14:48,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:48,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 506 [2025-03-17 11:14:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:48,526 INFO L124 PetriNetUnfolderBase]: 153/2461 cut-off events. [2025-03-17 11:14:48,527 INFO L125 PetriNetUnfolderBase]: For 78/123 co-relation queries the response was YES. [2025-03-17 11:14:48,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 2461 events. 153/2461 cut-off events. For 78/123 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14881 event pairs, 45 based on Foata normal form. 10/2292 useless extension candidates. Maximal degree in co-relation 2965. Up to 121 conditions per place. [2025-03-17 11:14:48,541 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 24 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-03-17 11:14:48,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 484 transitions, 1269 flow [2025-03-17 11:14:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:14:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:14:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2390 transitions. [2025-03-17 11:14:48,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446640316205533 [2025-03-17 11:14:48,545 INFO L175 Difference]: Start difference. First operand has 450 places, 473 transitions, 1181 flow. Second operand 5 states and 2390 transitions. [2025-03-17 11:14:48,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 484 transitions, 1269 flow [2025-03-17 11:14:48,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 484 transitions, 1269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:48,553 INFO L231 Difference]: Finished difference. Result has 456 places, 475 transitions, 1206 flow [2025-03-17 11:14:48,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1206, PETRI_PLACES=456, PETRI_TRANSITIONS=475} [2025-03-17 11:14:48,555 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2025-03-17 11:14:48,555 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 475 transitions, 1206 flow [2025-03-17 11:14:48,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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-17 11:14:48,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:48,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:48,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:14:48,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:48,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash -136948536, now seen corresponding path program 1 times [2025-03-17 11:14:48,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:48,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077007844] [2025-03-17 11:14:48,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:48,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:48,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:14:48,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:14:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:48,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:48,965 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-17 11:14:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077007844] [2025-03-17 11:14:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077007844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174389135] [2025-03-17 11:14:48,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:48,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:48,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:48,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:49,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-17 11:14:49,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 475 transitions, 1206 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-17 11:14:49,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:49,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-17 11:14:49,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:50,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1119] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][366], [504#(= |#race~N~0| 0), 251#L51-24true, 137#L62true, Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 559#true, 152#L89-1true, Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 526#true, Black: 562#(<= (+ ~M~0 1) 0), 525#(= |#race~M~0| 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), Black: 530#true, 538#true, 528#(= |#race~C1~0| 0), Black: 534#true, 464#L67-24true, 532#(= |#race~A~0| 0), 566#true]) [2025-03-17 11:14:50,952 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-17 11:14:50,952 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-17 11:14:50,952 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:14:50,952 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:14:51,349 INFO L124 PetriNetUnfolderBase]: 2249/13794 cut-off events. [2025-03-17 11:14:51,349 INFO L125 PetriNetUnfolderBase]: For 873/909 co-relation queries the response was YES. [2025-03-17 11:14:51,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18868 conditions, 13794 events. 2249/13794 cut-off events. For 873/909 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 151419 event pairs, 1160 based on Foata normal form. 0/12392 useless extension candidates. Maximal degree in co-relation 18816. Up to 3033 conditions per place. [2025-03-17 11:14:51,418 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 54 selfloop transitions, 38 changer transitions 0/520 dead transitions. [2025-03-17 11:14:51,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 520 transitions, 1488 flow [2025-03-17 11:14:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-17 11:14:51,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-17 11:14:51,422 INFO L175 Difference]: Start difference. First operand has 456 places, 475 transitions, 1206 flow. Second operand 6 states and 2767 transitions. [2025-03-17 11:14:51,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 520 transitions, 1488 flow [2025-03-17 11:14:51,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 520 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:51,436 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1455 flow [2025-03-17 11:14:51,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1455, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2025-03-17 11:14:51,437 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2025-03-17 11:14:51,438 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1455 flow [2025-03-17 11:14:51,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-17 11:14:51,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:51,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:51,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:14:51,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:51,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1536476617, now seen corresponding path program 1 times [2025-03-17 11:14:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728455021] [2025-03-17 11:14:51,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:51,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 11:14:51,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 11:14:51,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:51,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:51,482 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-17 11:14:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728455021] [2025-03-17 11:14:51,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728455021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:51,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:51,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39087601] [2025-03-17 11:14:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:51,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:51,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:51,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-17 11:14:51,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-17 11:14:51,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:51,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-17 11:14:51,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:52,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1119] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][356], [579#(= |#race~B~0| 0), 251#L51-24true, 152#L89-1true, 95#L59-25true, Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 464#L67-24true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-17 11:14:52,755 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-17 11:14:52,755 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-17 11:14:52,755 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:14:52,755 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:14:53,026 INFO L124 PetriNetUnfolderBase]: 1600/11576 cut-off events. [2025-03-17 11:14:53,026 INFO L125 PetriNetUnfolderBase]: For 741/958 co-relation queries the response was YES. [2025-03-17 11:14:53,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16517 conditions, 11576 events. 1600/11576 cut-off events. For 741/958 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 122820 event pairs, 343 based on Foata normal form. 0/10650 useless extension candidates. Maximal degree in co-relation 16462. Up to 1365 conditions per place. [2025-03-17 11:14:53,100 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 18 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2025-03-17 11:14:53,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 517 transitions, 1512 flow [2025-03-17 11:14:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2025-03-17 11:14:53,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2025-03-17 11:14:53,103 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1455 flow. Second operand 3 states and 1449 transitions. [2025-03-17 11:14:53,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 517 transitions, 1512 flow [2025-03-17 11:14:53,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 517 transitions, 1512 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:53,114 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1470 flow [2025-03-17 11:14:53,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2025-03-17 11:14:53,115 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2025-03-17 11:14:53,116 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1470 flow [2025-03-17 11:14:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-17 11:14:53,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:53,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:53,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:14:53,117 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -520423321, now seen corresponding path program 1 times [2025-03-17 11:14:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008694614] [2025-03-17 11:14:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:53,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 11:14:53,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 11:14:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:53,595 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-17 11:14:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008694614] [2025-03-17 11:14:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008694614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:53,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086466078] [2025-03-17 11:14:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:53,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:53,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:53,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:54,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-17 11:14:54,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1470 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-17 11:14:54,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:54,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-17 11:14:54,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:57,426 INFO L124 PetriNetUnfolderBase]: 4627/22163 cut-off events. [2025-03-17 11:14:57,426 INFO L125 PetriNetUnfolderBase]: For 5450/8007 co-relation queries the response was YES. [2025-03-17 11:14:57,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36861 conditions, 22163 events. 4627/22163 cut-off events. For 5450/8007 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 267244 event pairs, 1255 based on Foata normal form. 57/20417 useless extension candidates. Maximal degree in co-relation 36804. Up to 5415 conditions per place. [2025-03-17 11:14:57,595 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 85 selfloop transitions, 110 changer transitions 0/629 dead transitions. [2025-03-17 11:14:57,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 629 transitions, 2432 flow [2025-03-17 11:14:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-17 11:14:57,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-17 11:14:57,598 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1470 flow. Second operand 6 states and 2767 transitions. [2025-03-17 11:14:57,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 629 transitions, 2432 flow [2025-03-17 11:14:57,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 629 transitions, 2432 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:57,618 INFO L231 Difference]: Finished difference. Result has 474 places, 621 transitions, 2528 flow [2025-03-17 11:14:57,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2528, PETRI_PLACES=474, PETRI_TRANSITIONS=621} [2025-03-17 11:14:57,619 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 2 predicate places. [2025-03-17 11:14:57,619 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 621 transitions, 2528 flow [2025-03-17 11:14:57,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-17 11:14:57,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:57,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:14:57,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:14:57,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:14:57,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1312692524, now seen corresponding path program 1 times [2025-03-17 11:14:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260305552] [2025-03-17 11:14:57,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:57,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 11:14:57,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 11:14:57,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:57,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:57,951 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-17 11:14:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260305552] [2025-03-17 11:14:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260305552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:57,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879980356] [2025-03-17 11:14:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:57,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:57,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:58,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-17 11:14:58,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 621 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-17 11:14:58,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:58,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-17 11:14:58,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:02,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1119] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][355], [579#(= |#race~B~0| 0), 592#true, Black: 577#true, 251#L51-24true, 137#L62true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 152#L89-1true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 464#L67-24true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-17 11:15:02,389 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-17 11:15:02,389 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:15:02,389 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-17 11:15:02,389 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:15:03,453 INFO L124 PetriNetUnfolderBase]: 6954/31115 cut-off events. [2025-03-17 11:15:03,454 INFO L125 PetriNetUnfolderBase]: For 23405/33913 co-relation queries the response was YES. [2025-03-17 11:15:03,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61286 conditions, 31115 events. 6954/31115 cut-off events. For 23405/33913 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 394755 event pairs, 1661 based on Foata normal form. 203/29015 useless extension candidates. Maximal degree in co-relation 61224. Up to 7756 conditions per place. [2025-03-17 11:15:03,788 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 187 selfloop transitions, 215 changer transitions 0/838 dead transitions. [2025-03-17 11:15:03,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 838 transitions, 5026 flow [2025-03-17 11:15:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-17 11:15:03,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-17 11:15:03,792 INFO L175 Difference]: Start difference. First operand has 474 places, 621 transitions, 2528 flow. Second operand 6 states and 2767 transitions. [2025-03-17 11:15:03,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 838 transitions, 5026 flow [2025-03-17 11:15:03,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 838 transitions, 5026 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:03,843 INFO L231 Difference]: Finished difference. Result has 484 places, 830 transitions, 5178 flow [2025-03-17 11:15:03,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5178, PETRI_PLACES=484, PETRI_TRANSITIONS=830} [2025-03-17 11:15:03,844 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 12 predicate places. [2025-03-17 11:15:03,844 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 830 transitions, 5178 flow [2025-03-17 11:15:03,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-17 11:15:03,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:03,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:03,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:15:03,846 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:15:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash 305674059, now seen corresponding path program 1 times [2025-03-17 11:15:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903577742] [2025-03-17 11:15:03,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:03,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 11:15:03,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 11:15:03,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:04,440 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-17 11:15:04,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:04,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903577742] [2025-03-17 11:15:04,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903577742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:04,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:04,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:04,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377566202] [2025-03-17 11:15:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:04,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:04,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:04,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:04,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:04,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-17 11:15:04,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 830 transitions, 5178 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-17 11:15:04,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:04,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-17 11:15:04,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:11,918 INFO L124 PetriNetUnfolderBase]: 10076/38698 cut-off events. [2025-03-17 11:15:11,918 INFO L125 PetriNetUnfolderBase]: For 70957/79696 co-relation queries the response was YES. [2025-03-17 11:15:12,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93348 conditions, 38698 events. 10076/38698 cut-off events. For 70957/79696 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 497006 event pairs, 1689 based on Foata normal form. 670/36722 useless extension candidates. Maximal degree in co-relation 93281. Up to 11029 conditions per place. [2025-03-17 11:15:12,491 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 382 selfloop transitions, 495 changer transitions 0/1319 dead transitions. [2025-03-17 11:15:12,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1319 transitions, 12054 flow [2025-03-17 11:15:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:15:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:15:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-17 11:15:12,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-17 11:15:12,495 INFO L175 Difference]: Start difference. First operand has 484 places, 830 transitions, 5178 flow. Second operand 6 states and 2767 transitions. [2025-03-17 11:15:12,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1319 transitions, 12054 flow [2025-03-17 11:15:12,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1319 transitions, 12054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:15:12,621 INFO L231 Difference]: Finished difference. Result has 494 places, 1311 transitions, 12524 flow [2025-03-17 11:15:12,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=5178, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12524, PETRI_PLACES=494, PETRI_TRANSITIONS=1311} [2025-03-17 11:15:12,622 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 22 predicate places. [2025-03-17 11:15:12,622 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 1311 transitions, 12524 flow [2025-03-17 11:15:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-17 11:15:12,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:12,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:15:12,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:15:12,624 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-17 11:15:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1828703975, now seen corresponding path program 1 times [2025-03-17 11:15:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:12,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440861650] [2025-03-17 11:15:12,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:12,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:15:12,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:15:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:15:12,924 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-17 11:15:12,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:15:12,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440861650] [2025-03-17 11:15:12,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440861650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:15:12,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:15:12,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:15:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081026919] [2025-03-17 11:15:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:15:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:15:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:15:12,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:15:12,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:15:13,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 506 [2025-03-17 11:15:13,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1311 transitions, 12524 flow. Second operand has 6 states, 6 states have (on average 419.1666666666667) internal successors, (2515), 6 states have internal predecessors, (2515), 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-17 11:15:13,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:15:13,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 506 [2025-03-17 11:15:13,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:15:28,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1119] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][353], [579#(= |#race~B~0| 0), 592#true, Black: 577#true, 251#L51-24true, 137#L62true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 152#L89-1true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 464#L67-24true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-17 11:15:28,761 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-17 11:15:28,761 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-17 11:15:28,761 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:15:28,761 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-17 11:15:34,155 INFO L124 PetriNetUnfolderBase]: 40929/100034 cut-off events. [2025-03-17 11:15:34,155 INFO L125 PetriNetUnfolderBase]: For 188179/191986 co-relation queries the response was YES. [2025-03-17 11:15:35,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281372 conditions, 100034 events. 40929/100034 cut-off events. For 188179/191986 co-relation queries the response was YES. Maximal size of possible extension queue 2200. Compared 1217041 event pairs, 16417 based on Foata normal form. 702/93537 useless extension candidates. Maximal degree in co-relation 281300. Up to 57622 conditions per place.