./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:24:43,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:24:43,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:24:43,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:24:43,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:24:43,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:24:43,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:24:43,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:24:43,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:24:43,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:24:43,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:24:43,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:24:43,234 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:24:43,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:24:43,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:24:43,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:24:43,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:24:43,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:24:43,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:24:43,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:24:43,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:24:43,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:24:43,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:43,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:24:43,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:24:43,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:24:43,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:24:43,240 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-03-13 22:24:43,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:24:43,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:24:43,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:24:43,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:24:43,464 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:24:43,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-13 22:24:44,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a31ff3c2/383d6ca79f004df1ab491ce5ad1b4a23/FLAG7c6ea9a69 [2025-03-13 22:24:44,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:24:44,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-13 22:24:44,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a31ff3c2/383d6ca79f004df1ab491ce5ad1b4a23/FLAG7c6ea9a69 [2025-03-13 22:24:45,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a31ff3c2/383d6ca79f004df1ab491ce5ad1b4a23 [2025-03-13 22:24:45,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:24:45,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:24:45,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:45,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:24:45,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:24:45,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae1e956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45, skipping insertion in model container [2025-03-13 22:24:45,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:24:45,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:45,358 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:24:45,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:24:45,412 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:24:45,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45 WrapperNode [2025-03-13 22:24:45,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:24:45,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:45,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:24:45,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:24:45,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,466 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 503 [2025-03-13 22:24:45,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:24:45,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:24:45,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:24:45,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:24:45,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:24:45,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:24:45,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:24:45,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:24:45,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (1/1) ... [2025-03-13 22:24:45,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:24:45,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:24:45,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:24:45,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:24:45,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:24:45,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:24:45,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:24:45,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:24:45,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:24:45,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:24:45,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:24:45,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:24:45,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:24:45,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:24:45,571 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:24:45,665 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:24:45,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:24:46,286 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:24:46,287 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:24:46,287 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:24:46,307 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:24:46,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:46 BoogieIcfgContainer [2025-03-13 22:24:46,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:24:46,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:24:46,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:24:46,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:24:46,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:24:45" (1/3) ... [2025-03-13 22:24:46,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e428919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:46, skipping insertion in model container [2025-03-13 22:24:46,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:24:45" (2/3) ... [2025-03-13 22:24:46,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e428919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:24:46, skipping insertion in model container [2025-03-13 22:24:46,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:46" (3/3) ... [2025-03-13 22:24:46,315 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-03-13 22:24:46,325 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:24:46,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 674 locations, 1 initial locations, 3 loop locations, and 73 error locations. [2025-03-13 22:24:46,327 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:24:46,478 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:24:46,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 680 places, 705 transitions, 1424 flow [2025-03-13 22:24:46,713 INFO L124 PetriNetUnfolderBase]: 32/703 cut-off events. [2025-03-13 22:24:46,715 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:46,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 703 events. 32/703 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1908 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 456. Up to 2 conditions per place. [2025-03-13 22:24:46,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 680 places, 705 transitions, 1424 flow [2025-03-13 22:24:46,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 662 places, 686 transitions, 1384 flow [2025-03-13 22:24:46,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:24:46,761 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;@5fed20c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:24:46,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 123 error locations. [2025-03-13 22:24:46,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:24:46,766 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-13 22:24:46,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:24:46,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:46,767 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] [2025-03-13 22:24:46,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:46,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1434984346, now seen corresponding path program 1 times [2025-03-13 22:24:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:46,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415955733] [2025-03-13 22:24:46,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:46,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 22:24:46,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 22:24:46,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:46,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:46,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:46,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415955733] [2025-03-13 22:24:46,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415955733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:46,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:46,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5133306] [2025-03-13 22:24:46,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:46,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:46,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:46,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:47,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-03-13 22:24:47,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 686 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:47,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-03-13 22:24:47,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:47,315 INFO L124 PetriNetUnfolderBase]: 28/1966 cut-off events. [2025-03-13 22:24:47,315 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-13 22:24:47,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1966 events. 28/1966 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 10274 event pairs, 6 based on Foata normal form. 81/1738 useless extension candidates. Maximal degree in co-relation 1769. Up to 32 conditions per place. [2025-03-13 22:24:47,331 INFO L140 encePairwiseOnDemand]: 681/705 looper letters, 19 selfloop transitions, 2 changer transitions 3/664 dead transitions. [2025-03-13 22:24:47,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 664 transitions, 1382 flow [2025-03-13 22:24:47,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2020 transitions. [2025-03-13 22:24:47,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550827423167849 [2025-03-13 22:24:47,354 INFO L175 Difference]: Start difference. First operand has 662 places, 686 transitions, 1384 flow. Second operand 3 states and 2020 transitions. [2025-03-13 22:24:47,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 664 transitions, 1382 flow [2025-03-13 22:24:47,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 664 transitions, 1374 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:24:47,376 INFO L231 Difference]: Finished difference. Result has 659 places, 661 transitions, 1330 flow [2025-03-13 22:24:47,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=659, PETRI_TRANSITIONS=661} [2025-03-13 22:24:47,382 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -3 predicate places. [2025-03-13 22:24:47,384 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 661 transitions, 1330 flow [2025-03-13 22:24:47,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:47,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:47,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:24:47,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:47,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash -462712004, now seen corresponding path program 1 times [2025-03-13 22:24:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:47,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103481079] [2025-03-13 22:24:47,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:47,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:24:47,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:24:47,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:47,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103481079] [2025-03-13 22:24:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103481079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638718572] [2025-03-13 22:24:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:47,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:47,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:47,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-13 22:24:47,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 661 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:47,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-13 22:24:47,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:47,639 INFO L124 PetriNetUnfolderBase]: 19/880 cut-off events. [2025-03-13 22:24:47,639 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-13 22:24:47,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 880 events. 19/880 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3080 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 883. Up to 29 conditions per place. [2025-03-13 22:24:47,649 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/660 dead transitions. [2025-03-13 22:24:47,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 660 transitions, 1360 flow [2025-03-13 22:24:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-13 22:24:47,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-13 22:24:47,654 INFO L175 Difference]: Start difference. First operand has 659 places, 661 transitions, 1330 flow. Second operand 3 states and 2009 transitions. [2025-03-13 22:24:47,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 660 transitions, 1360 flow [2025-03-13 22:24:47,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 660 transitions, 1356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:47,664 INFO L231 Difference]: Finished difference. Result has 655 places, 660 transitions, 1328 flow [2025-03-13 22:24:47,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=655, PETRI_TRANSITIONS=660} [2025-03-13 22:24:47,666 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -7 predicate places. [2025-03-13 22:24:47,666 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 660 transitions, 1328 flow [2025-03-13 22:24:47,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:47,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:47,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:24:47,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:47,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash 958158355, now seen corresponding path program 1 times [2025-03-13 22:24:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:47,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966374430] [2025-03-13 22:24:47,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:47,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:24:47,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:24:47,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:47,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966374430] [2025-03-13 22:24:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966374430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658548429] [2025-03-13 22:24:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:47,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:47,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:47,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-03-13 22:24:47,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 660 transitions, 1328 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:47,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-03-13 22:24:47,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:47,864 INFO L124 PetriNetUnfolderBase]: 13/876 cut-off events. [2025-03-13 22:24:47,864 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-13 22:24:47,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 876 events. 13/876 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2743 event pairs, 1 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 854. Up to 11 conditions per place. [2025-03-13 22:24:47,875 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/659 dead transitions. [2025-03-13 22:24:47,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 659 transitions, 1346 flow [2025-03-13 22:24:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-03-13 22:24:47,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-03-13 22:24:47,880 INFO L175 Difference]: Start difference. First operand has 655 places, 660 transitions, 1328 flow. Second operand 3 states and 2021 transitions. [2025-03-13 22:24:47,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 659 transitions, 1346 flow [2025-03-13 22:24:47,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 659 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:47,890 INFO L231 Difference]: Finished difference. Result has 654 places, 659 transitions, 1326 flow [2025-03-13 22:24:47,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1326, PETRI_PLACES=654, PETRI_TRANSITIONS=659} [2025-03-13 22:24:47,891 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -8 predicate places. [2025-03-13 22:24:47,891 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 659 transitions, 1326 flow [2025-03-13 22:24:47,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:47,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:47,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:24:47,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:47,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 193961989, now seen corresponding path program 1 times [2025-03-13 22:24:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:47,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575483455] [2025-03-13 22:24:47,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:47,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:24:47,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:24:47,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:47,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:47,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575483455] [2025-03-13 22:24:47,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575483455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:47,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335829770] [2025-03-13 22:24:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:47,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:47,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:47,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:47,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:47,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-03-13 22:24:47,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 659 transitions, 1326 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:47,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:47,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-03-13 22:24:47,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:48,066 INFO L124 PetriNetUnfolderBase]: 11/660 cut-off events. [2025-03-13 22:24:48,066 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-13 22:24:48,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 660 events. 11/660 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1853 event pairs, 1 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 629. Up to 11 conditions per place. [2025-03-13 22:24:48,072 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/658 dead transitions. [2025-03-13 22:24:48,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 658 transitions, 1344 flow [2025-03-13 22:24:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-03-13 22:24:48,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-03-13 22:24:48,076 INFO L175 Difference]: Start difference. First operand has 654 places, 659 transitions, 1326 flow. Second operand 3 states and 2021 transitions. [2025-03-13 22:24:48,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 658 transitions, 1344 flow [2025-03-13 22:24:48,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 658 transitions, 1340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:48,090 INFO L231 Difference]: Finished difference. Result has 653 places, 658 transitions, 1324 flow [2025-03-13 22:24:48,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1324, PETRI_PLACES=653, PETRI_TRANSITIONS=658} [2025-03-13 22:24:48,091 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -9 predicate places. [2025-03-13 22:24:48,091 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 658 transitions, 1324 flow [2025-03-13 22:24:48,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:48,093 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] [2025-03-13 22:24:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:24:48,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:48,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1990451773, now seen corresponding path program 1 times [2025-03-13 22:24:48,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631838785] [2025-03-13 22:24:48,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:48,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:24:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:24:48,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:48,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631838785] [2025-03-13 22:24:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631838785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:48,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:48,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441369364] [2025-03-13 22:24:48,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:48,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:48,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:48,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:48,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-13 22:24:48,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 658 transitions, 1324 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:48,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-13 22:24:48,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:48,334 INFO L124 PetriNetUnfolderBase]: 22/1525 cut-off events. [2025-03-13 22:24:48,335 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-13 22:24:48,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1525 events. 22/1525 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7096 event pairs, 4 based on Foata normal form. 0/1293 useless extension candidates. Maximal degree in co-relation 1501. Up to 22 conditions per place. [2025-03-13 22:24:48,350 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/657 dead transitions. [2025-03-13 22:24:48,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 657 transitions, 1352 flow [2025-03-13 22:24:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-13 22:24:48,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-13 22:24:48,354 INFO L175 Difference]: Start difference. First operand has 653 places, 658 transitions, 1324 flow. Second operand 3 states and 2011 transitions. [2025-03-13 22:24:48,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 657 transitions, 1352 flow [2025-03-13 22:24:48,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 657 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:48,362 INFO L231 Difference]: Finished difference. Result has 652 places, 657 transitions, 1322 flow [2025-03-13 22:24:48,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=652, PETRI_TRANSITIONS=657} [2025-03-13 22:24:48,365 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -10 predicate places. [2025-03-13 22:24:48,365 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 657 transitions, 1322 flow [2025-03-13 22:24:48,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:48,368 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] [2025-03-13 22:24:48,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:24:48,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:48,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -598585748, now seen corresponding path program 1 times [2025-03-13 22:24:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212429908] [2025-03-13 22:24:48,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:48,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:24:48,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:24:48,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:48,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:48,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:48,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212429908] [2025-03-13 22:24:48,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212429908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:48,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:48,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:48,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542303534] [2025-03-13 22:24:48,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:48,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:48,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:48,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:48,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:48,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-13 22:24:48,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 657 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:48,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-13 22:24:48,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:48,540 INFO L124 PetriNetUnfolderBase]: 14/701 cut-off events. [2025-03-13 22:24:48,540 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-13 22:24:48,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 701 events. 14/701 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2235 event pairs, 4 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 665. Up to 22 conditions per place. [2025-03-13 22:24:48,546 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/656 dead transitions. [2025-03-13 22:24:48,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 656 transitions, 1350 flow [2025-03-13 22:24:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-13 22:24:48,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-13 22:24:48,549 INFO L175 Difference]: Start difference. First operand has 652 places, 657 transitions, 1322 flow. Second operand 3 states and 2011 transitions. [2025-03-13 22:24:48,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 656 transitions, 1350 flow [2025-03-13 22:24:48,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 656 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:48,556 INFO L231 Difference]: Finished difference. Result has 651 places, 656 transitions, 1320 flow [2025-03-13 22:24:48,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1320, PETRI_PLACES=651, PETRI_TRANSITIONS=656} [2025-03-13 22:24:48,559 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -11 predicate places. [2025-03-13 22:24:48,559 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 656 transitions, 1320 flow [2025-03-13 22:24:48,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:48,561 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] [2025-03-13 22:24:48,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:24:48,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1875839642, now seen corresponding path program 1 times [2025-03-13 22:24:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18750284] [2025-03-13 22:24:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:48,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-13 22:24:48,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-13 22:24:48,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:48,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:48,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18750284] [2025-03-13 22:24:48,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18750284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:48,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:48,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582332242] [2025-03-13 22:24:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:48,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:48,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:48,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:48,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-13 22:24:48,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 656 transitions, 1320 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:48,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-13 22:24:48,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:48,747 INFO L124 PetriNetUnfolderBase]: 18/874 cut-off events. [2025-03-13 22:24:48,747 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:24:48,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 874 events. 18/874 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3347 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 842. Up to 28 conditions per place. [2025-03-13 22:24:48,756 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2025-03-13 22:24:48,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 655 transitions, 1350 flow [2025-03-13 22:24:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-13 22:24:48,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-13 22:24:48,760 INFO L175 Difference]: Start difference. First operand has 651 places, 656 transitions, 1320 flow. Second operand 3 states and 2009 transitions. [2025-03-13 22:24:48,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 655 transitions, 1350 flow [2025-03-13 22:24:48,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 655 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:48,767 INFO L231 Difference]: Finished difference. Result has 650 places, 655 transitions, 1318 flow [2025-03-13 22:24:48,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=650, PETRI_TRANSITIONS=655} [2025-03-13 22:24:48,768 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -12 predicate places. [2025-03-13 22:24:48,768 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 655 transitions, 1318 flow [2025-03-13 22:24:48,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:48,770 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] [2025-03-13 22:24:48,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:24:48,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:48,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 285013060, now seen corresponding path program 1 times [2025-03-13 22:24:48,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:48,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656118158] [2025-03-13 22:24:48,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:48,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-13 22:24:48,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-13 22:24:48,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:48,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:48,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:48,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656118158] [2025-03-13 22:24:48,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656118158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:48,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:48,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:48,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790249287] [2025-03-13 22:24:48,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:48,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:48,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:48,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:48,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-13 22:24:48,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 655 transitions, 1318 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:48,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-13 22:24:48,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:48,964 INFO L124 PetriNetUnfolderBase]: 18/873 cut-off events. [2025-03-13 22:24:48,965 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-13 22:24:48,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 873 events. 18/873 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3103 event pairs, 6 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 827. Up to 28 conditions per place. [2025-03-13 22:24:48,973 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/654 dead transitions. [2025-03-13 22:24:48,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 654 transitions, 1348 flow [2025-03-13 22:24:48,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-13 22:24:48,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-13 22:24:48,977 INFO L175 Difference]: Start difference. First operand has 650 places, 655 transitions, 1318 flow. Second operand 3 states and 2009 transitions. [2025-03-13 22:24:48,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 654 transitions, 1348 flow [2025-03-13 22:24:48,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 654 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:48,985 INFO L231 Difference]: Finished difference. Result has 649 places, 654 transitions, 1316 flow [2025-03-13 22:24:48,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=649, PETRI_TRANSITIONS=654} [2025-03-13 22:24:48,986 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -13 predicate places. [2025-03-13 22:24:48,987 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 654 transitions, 1316 flow [2025-03-13 22:24:48,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:48,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:48,988 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] [2025-03-13 22:24:48,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:24:48,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:48,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash 659888565, now seen corresponding path program 1 times [2025-03-13 22:24:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:48,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200168932] [2025-03-13 22:24:48,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:48,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:48,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 22:24:48,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 22:24:48,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:48,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:49,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:49,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200168932] [2025-03-13 22:24:49,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200168932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:49,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:49,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:49,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830482992] [2025-03-13 22:24:49,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:49,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:49,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:49,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:49,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-13 22:24:49,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 654 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:49,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:49,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-13 22:24:49,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:49,175 INFO L124 PetriNetUnfolderBase]: 17/1083 cut-off events. [2025-03-13 22:24:49,175 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:24:49,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1083 events. 17/1083 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4833 event pairs, 3 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 1021. Up to 19 conditions per place. [2025-03-13 22:24:49,184 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 10 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2025-03-13 22:24:49,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 653 transitions, 1338 flow [2025-03-13 22:24:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2017 transitions. [2025-03-13 22:24:49,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536643026004729 [2025-03-13 22:24:49,188 INFO L175 Difference]: Start difference. First operand has 649 places, 654 transitions, 1316 flow. Second operand 3 states and 2017 transitions. [2025-03-13 22:24:49,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 653 transitions, 1338 flow [2025-03-13 22:24:49,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 653 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:49,195 INFO L231 Difference]: Finished difference. Result has 648 places, 653 transitions, 1314 flow [2025-03-13 22:24:49,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1314, PETRI_PLACES=648, PETRI_TRANSITIONS=653} [2025-03-13 22:24:49,197 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2025-03-13 22:24:49,197 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 653 transitions, 1314 flow [2025-03-13 22:24:49,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:49,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:49,198 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] [2025-03-13 22:24:49,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:24:49,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:49,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -518922382, now seen corresponding path program 1 times [2025-03-13 22:24:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:49,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160259878] [2025-03-13 22:24:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:49,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 22:24:49,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 22:24:49,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:49,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160259878] [2025-03-13 22:24:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160259878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386497063] [2025-03-13 22:24:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:49,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:49,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:49,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-13 22:24:49,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 653 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:49,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:49,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-13 22:24:49,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:49,446 INFO L124 PetriNetUnfolderBase]: 29/1717 cut-off events. [2025-03-13 22:24:49,446 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:24:49,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1717 events. 29/1717 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 9702 event pairs, 8 based on Foata normal form. 0/1462 useless extension candidates. Maximal degree in co-relation 1661. Up to 32 conditions per place. [2025-03-13 22:24:49,454 INFO L140 encePairwiseOnDemand]: 701/705 looper letters, 10 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2025-03-13 22:24:49,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 650 transitions, 1330 flow [2025-03-13 22:24:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-03-13 22:24:49,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541371158392435 [2025-03-13 22:24:49,458 INFO L175 Difference]: Start difference. First operand has 648 places, 653 transitions, 1314 flow. Second operand 3 states and 2018 transitions. [2025-03-13 22:24:49,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 650 transitions, 1330 flow [2025-03-13 22:24:49,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 650 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:49,464 INFO L231 Difference]: Finished difference. Result has 645 places, 650 transitions, 1306 flow [2025-03-13 22:24:49,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=645, PETRI_TRANSITIONS=650} [2025-03-13 22:24:49,465 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -17 predicate places. [2025-03-13 22:24:49,465 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 650 transitions, 1306 flow [2025-03-13 22:24:49,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:49,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:49,467 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] [2025-03-13 22:24:49,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:24:49,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:49,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash -588922876, now seen corresponding path program 1 times [2025-03-13 22:24:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:49,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364055562] [2025-03-13 22:24:49,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:49,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-13 22:24:49,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-13 22:24:49,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:49,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364055562] [2025-03-13 22:24:49,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364055562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:49,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:49,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188702930] [2025-03-13 22:24:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:49,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:49,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:49,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:50,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 705 [2025-03-13 22:24:50,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 650 transitions, 1306 flow. Second operand has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:50,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:50,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 705 [2025-03-13 22:24:50,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:50,629 INFO L124 PetriNetUnfolderBase]: 244/4163 cut-off events. [2025-03-13 22:24:50,630 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-03-13 22:24:50,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 4163 events. 244/4163 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 32056 event pairs, 168 based on Foata normal form. 0/3508 useless extension candidates. Maximal degree in co-relation 4509. Up to 421 conditions per place. [2025-03-13 22:24:50,651 INFO L140 encePairwiseOnDemand]: 699/705 looper letters, 36 selfloop transitions, 5 changer transitions 0/649 dead transitions. [2025-03-13 22:24:50,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 649 transitions, 1386 flow [2025-03-13 22:24:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3882 transitions. [2025-03-13 22:24:50,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177304964539007 [2025-03-13 22:24:50,659 INFO L175 Difference]: Start difference. First operand has 645 places, 650 transitions, 1306 flow. Second operand 6 states and 3882 transitions. [2025-03-13 22:24:50,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 649 transitions, 1386 flow [2025-03-13 22:24:50,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 649 transitions, 1385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:50,668 INFO L231 Difference]: Finished difference. Result has 648 places, 649 transitions, 1313 flow [2025-03-13 22:24:50,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1313, PETRI_PLACES=648, PETRI_TRANSITIONS=649} [2025-03-13 22:24:50,670 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2025-03-13 22:24:50,670 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 649 transitions, 1313 flow [2025-03-13 22:24:50,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:50,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:50,673 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] [2025-03-13 22:24:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:24:50,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:50,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash -134011025, now seen corresponding path program 1 times [2025-03-13 22:24:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795077438] [2025-03-13 22:24:50,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:50,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-13 22:24:50,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-13 22:24:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795077438] [2025-03-13 22:24:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795077438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799613131] [2025-03-13 22:24:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:50,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:50,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:50,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:50,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-13 22:24:50,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 649 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:50,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:50,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-13 22:24:50,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:50,913 INFO L124 PetriNetUnfolderBase]: 34/1521 cut-off events. [2025-03-13 22:24:50,914 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:24:50,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1521 events. 34/1521 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7565 event pairs, 15 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 1564. Up to 46 conditions per place. [2025-03-13 22:24:50,925 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2025-03-13 22:24:50,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 648 transitions, 1341 flow [2025-03-13 22:24:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-13 22:24:50,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-13 22:24:50,929 INFO L175 Difference]: Start difference. First operand has 648 places, 649 transitions, 1313 flow. Second operand 3 states and 2011 transitions. [2025-03-13 22:24:50,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 648 transitions, 1341 flow [2025-03-13 22:24:50,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 648 transitions, 1331 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:24:50,936 INFO L231 Difference]: Finished difference. Result has 644 places, 648 transitions, 1305 flow [2025-03-13 22:24:50,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=644, PETRI_TRANSITIONS=648} [2025-03-13 22:24:50,937 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -18 predicate places. [2025-03-13 22:24:50,937 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 648 transitions, 1305 flow [2025-03-13 22:24:50,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:50,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:50,938 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] [2025-03-13 22:24:50,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:24:50,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:50,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1820509187, now seen corresponding path program 1 times [2025-03-13 22:24:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77414473] [2025-03-13 22:24:50,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:50,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-13 22:24:50,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-13 22:24:50,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:50,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:50,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:50,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77414473] [2025-03-13 22:24:50,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77414473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:50,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:50,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:50,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556730741] [2025-03-13 22:24:50,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:50,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:50,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:50,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:51,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 705 [2025-03-13 22:24:51,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 648 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:51,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 705 [2025-03-13 22:24:51,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:51,184 INFO L124 PetriNetUnfolderBase]: 28/1297 cut-off events. [2025-03-13 22:24:51,184 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-13 22:24:51,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 1297 events. 28/1297 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6703 event pairs, 8 based on Foata normal form. 0/1124 useless extension candidates. Maximal degree in co-relation 1268. Up to 44 conditions per place. [2025-03-13 22:24:51,195 INFO L140 encePairwiseOnDemand]: 690/705 looper letters, 25 selfloop transitions, 5 changer transitions 0/641 dead transitions. [2025-03-13 22:24:51,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 641 transitions, 1352 flow [2025-03-13 22:24:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2025-03-13 22:24:51,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.933806146572104 [2025-03-13 22:24:51,199 INFO L175 Difference]: Start difference. First operand has 644 places, 648 transitions, 1305 flow. Second operand 3 states and 1975 transitions. [2025-03-13 22:24:51,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 641 transitions, 1352 flow [2025-03-13 22:24:51,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 641 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:51,209 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1304 flow [2025-03-13 22:24:51,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2025-03-13 22:24:51,211 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -27 predicate places. [2025-03-13 22:24:51,211 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1304 flow [2025-03-13 22:24:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:51,212 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] [2025-03-13 22:24:51,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:24:51,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1457664460, now seen corresponding path program 1 times [2025-03-13 22:24:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712583851] [2025-03-13 22:24:51,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:51,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-13 22:24:51,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-13 22:24:51,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:51,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712583851] [2025-03-13 22:24:51,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712583851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:51,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500670849] [2025-03-13 22:24:51,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:51,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:51,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:51,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:51,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 705 [2025-03-13 22:24:51,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:51,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 705 [2025-03-13 22:24:51,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:51,371 INFO L124 PetriNetUnfolderBase]: 25/876 cut-off events. [2025-03-13 22:24:51,371 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-03-13 22:24:51,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 876 events. 25/876 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3207 event pairs, 8 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 835. Up to 34 conditions per place. [2025-03-13 22:24:51,379 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 15 selfloop transitions, 5 changer transitions 0/638 dead transitions. [2025-03-13 22:24:51,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 638 transitions, 1341 flow [2025-03-13 22:24:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2005 transitions. [2025-03-13 22:24:51,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479905437352246 [2025-03-13 22:24:51,383 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1304 flow. Second operand 3 states and 2005 transitions. [2025-03-13 22:24:51,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 638 transitions, 1341 flow [2025-03-13 22:24:51,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 638 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:51,390 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1312 flow [2025-03-13 22:24:51,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2025-03-13 22:24:51,392 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -30 predicate places. [2025-03-13 22:24:51,392 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1312 flow [2025-03-13 22:24:51,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:51,393 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] [2025-03-13 22:24:51,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:24:51,393 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:51,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1191689848, now seen corresponding path program 1 times [2025-03-13 22:24:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593803252] [2025-03-13 22:24:51,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:51,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-13 22:24:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-13 22:24:51,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:51,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593803252] [2025-03-13 22:24:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593803252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397082800] [2025-03-13 22:24:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:51,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:51,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:51,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:51,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:51,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-03-13 22:24:51,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:51,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-03-13 22:24:51,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:51,642 INFO L124 PetriNetUnfolderBase]: 40/1573 cut-off events. [2025-03-13 22:24:51,642 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-13 22:24:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 1573 events. 40/1573 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 7282 event pairs, 2 based on Foata normal form. 0/1373 useless extension candidates. Maximal degree in co-relation 1578. Up to 30 conditions per place. [2025-03-13 22:24:51,658 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 13 selfloop transitions, 6 changer transitions 0/637 dead transitions. [2025-03-13 22:24:51,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 637 transitions, 1352 flow [2025-03-13 22:24:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-03-13 22:24:51,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-03-13 22:24:51,663 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1312 flow. Second operand 3 states and 2012 transitions. [2025-03-13 22:24:51,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 637 transitions, 1352 flow [2025-03-13 22:24:51,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 637 transitions, 1347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:51,674 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1325 flow [2025-03-13 22:24:51,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2025-03-13 22:24:51,676 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -32 predicate places. [2025-03-13 22:24:51,676 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1325 flow [2025-03-13 22:24:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:51,682 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] [2025-03-13 22:24:51,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:24:51,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:51,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash -496785864, now seen corresponding path program 1 times [2025-03-13 22:24:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933920670] [2025-03-13 22:24:51,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:51,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-13 22:24:51,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-13 22:24:51,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:51,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:51,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:51,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933920670] [2025-03-13 22:24:51,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933920670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:51,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:51,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:51,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571750502] [2025-03-13 22:24:51,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:51,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:51,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:51,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:51,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-03-13 22:24:51,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:51,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:51,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-03-13 22:24:51,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:52,015 INFO L124 PetriNetUnfolderBase]: 53/1813 cut-off events. [2025-03-13 22:24:52,015 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-13 22:24:52,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 1813 events. 53/1813 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10979 event pairs, 2 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 1851. Up to 43 conditions per place. [2025-03-13 22:24:52,030 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 12 selfloop transitions, 5 changer transitions 4/636 dead transitions. [2025-03-13 22:24:52,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 636 transitions, 1368 flow [2025-03-13 22:24:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-03-13 22:24:52,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-03-13 22:24:52,034 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1325 flow. Second operand 3 states and 2012 transitions. [2025-03-13 22:24:52,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 636 transitions, 1368 flow [2025-03-13 22:24:52,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 636 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:52,041 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1323 flow [2025-03-13 22:24:52,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1323, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2025-03-13 22:24:52,043 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -34 predicate places. [2025-03-13 22:24:52,043 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1323 flow [2025-03-13 22:24:52,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:52,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:52,044 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] [2025-03-13 22:24:52,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:24:52,044 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:52,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash -203516272, now seen corresponding path program 1 times [2025-03-13 22:24:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:52,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204576645] [2025-03-13 22:24:52,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:52,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-13 22:24:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-13 22:24:52,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:52,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:52,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:52,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204576645] [2025-03-13 22:24:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204576645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:52,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:52,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538491958] [2025-03-13 22:24:52,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:52,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:52,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:52,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:52,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-03-13 22:24:52,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1323 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:52,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:52,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-03-13 22:24:52,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:52,583 INFO L124 PetriNetUnfolderBase]: 129/3255 cut-off events. [2025-03-13 22:24:52,583 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-13 22:24:52,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3660 conditions, 3255 events. 129/3255 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 25028 event pairs, 4 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 3559. Up to 158 conditions per place. [2025-03-13 22:24:52,610 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 17 selfloop transitions, 3 changer transitions 0/626 dead transitions. [2025-03-13 22:24:52,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1359 flow [2025-03-13 22:24:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2000 transitions. [2025-03-13 22:24:52,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2025-03-13 22:24:52,614 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1323 flow. Second operand 3 states and 2000 transitions. [2025-03-13 22:24:52,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1359 flow [2025-03-13 22:24:52,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 626 transitions, 1354 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:52,634 INFO L231 Difference]: Finished difference. Result has 620 places, 624 transitions, 1319 flow [2025-03-13 22:24:52,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1319, PETRI_PLACES=620, PETRI_TRANSITIONS=624} [2025-03-13 22:24:52,635 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -42 predicate places. [2025-03-13 22:24:52,636 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 624 transitions, 1319 flow [2025-03-13 22:24:52,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:52,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:52,636 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] [2025-03-13 22:24:52,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:24:52,636 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:52,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:52,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2064126562, now seen corresponding path program 1 times [2025-03-13 22:24:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:52,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196228026] [2025-03-13 22:24:52,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:52,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:52,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-13 22:24:52,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-13 22:24:52,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:52,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:52,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196228026] [2025-03-13 22:24:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196228026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65951588] [2025-03-13 22:24:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:52,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:52,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:52,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:52,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-03-13 22:24:52,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 624 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:52,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:52,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-03-13 22:24:52,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:53,253 INFO L124 PetriNetUnfolderBase]: 122/3768 cut-off events. [2025-03-13 22:24:53,254 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2025-03-13 22:24:53,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 3768 events. 122/3768 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 31072 event pairs, 20 based on Foata normal form. 0/3397 useless extension candidates. Maximal degree in co-relation 4127. Up to 176 conditions per place. [2025-03-13 22:24:53,270 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 18 selfloop transitions, 3 changer transitions 0/622 dead transitions. [2025-03-13 22:24:53,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 622 transitions, 1360 flow [2025-03-13 22:24:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2001 transitions. [2025-03-13 22:24:53,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460992907801419 [2025-03-13 22:24:53,274 INFO L175 Difference]: Start difference. First operand has 620 places, 624 transitions, 1319 flow. Second operand 3 states and 2001 transitions. [2025-03-13 22:24:53,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 622 transitions, 1360 flow [2025-03-13 22:24:53,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 622 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:53,282 INFO L231 Difference]: Finished difference. Result has 616 places, 619 transitions, 1317 flow [2025-03-13 22:24:53,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=616, PETRI_TRANSITIONS=619} [2025-03-13 22:24:53,283 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -46 predicate places. [2025-03-13 22:24:53,283 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 619 transitions, 1317 flow [2025-03-13 22:24:53,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:53,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:53,284 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] [2025-03-13 22:24:53,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:24:53,284 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1538335944, now seen corresponding path program 1 times [2025-03-13 22:24:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987580433] [2025-03-13 22:24:53,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:53,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-13 22:24:53,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-13 22:24:53,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:53,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987580433] [2025-03-13 22:24:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987580433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546966320] [2025-03-13 22:24:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:53,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:53,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:53,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:53,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-03-13 22:24:53,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 619 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:53,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:53,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-03-13 22:24:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:54,245 INFO L124 PetriNetUnfolderBase]: 354/9609 cut-off events. [2025-03-13 22:24:54,246 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2025-03-13 22:24:54,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10800 conditions, 9609 events. 354/9609 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 98056 event pairs, 88 based on Foata normal form. 0/8697 useless extension candidates. Maximal degree in co-relation 10698. Up to 467 conditions per place. [2025-03-13 22:24:54,290 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 18 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2025-03-13 22:24:54,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 617 transitions, 1355 flow [2025-03-13 22:24:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2003 transitions. [2025-03-13 22:24:54,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9470449172576832 [2025-03-13 22:24:54,293 INFO L175 Difference]: Start difference. First operand has 616 places, 619 transitions, 1317 flow. Second operand 3 states and 2003 transitions. [2025-03-13 22:24:54,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 617 transitions, 1355 flow [2025-03-13 22:24:54,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 617 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:54,300 INFO L231 Difference]: Finished difference. Result has 612 places, 615 transitions, 1316 flow [2025-03-13 22:24:54,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=612, PETRI_TRANSITIONS=615} [2025-03-13 22:24:54,301 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -50 predicate places. [2025-03-13 22:24:54,301 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 615 transitions, 1316 flow [2025-03-13 22:24:54,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:54,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:54,301 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] [2025-03-13 22:24:54,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:24:54,302 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:54,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2015722289, now seen corresponding path program 1 times [2025-03-13 22:24:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:54,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554106341] [2025-03-13 22:24:54,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:54,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-13 22:24:54,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-13 22:24:54,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:54,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554106341] [2025-03-13 22:24:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554106341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:54,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334553046] [2025-03-13 22:24:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:54,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:54,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:54,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-03-13 22:24:54,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 615 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:54,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:54,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-03-13 22:24:54,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:55,559 INFO L124 PetriNetUnfolderBase]: 233/5969 cut-off events. [2025-03-13 22:24:55,559 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-03-13 22:24:55,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 5969 events. 233/5969 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 52333 event pairs, 8 based on Foata normal form. 0/5473 useless extension candidates. Maximal degree in co-relation 6784. Up to 228 conditions per place. [2025-03-13 22:24:55,597 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/616 dead transitions. [2025-03-13 22:24:55,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 616 transitions, 1384 flow [2025-03-13 22:24:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-03-13 22:24:55,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-03-13 22:24:55,601 INFO L175 Difference]: Start difference. First operand has 612 places, 615 transitions, 1316 flow. Second operand 6 states and 3940 transitions. [2025-03-13 22:24:55,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 616 transitions, 1384 flow [2025-03-13 22:24:55,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 616 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:55,610 INFO L231 Difference]: Finished difference. Result has 614 places, 612 transitions, 1320 flow [2025-03-13 22:24:55,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1320, PETRI_PLACES=614, PETRI_TRANSITIONS=612} [2025-03-13 22:24:55,611 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -48 predicate places. [2025-03-13 22:24:55,612 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 612 transitions, 1320 flow [2025-03-13 22:24:55,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:55,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:55,613 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] [2025-03-13 22:24:55,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:24:55,613 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:55,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:55,614 INFO L85 PathProgramCache]: Analyzing trace with hash -683827749, now seen corresponding path program 1 times [2025-03-13 22:24:55,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:55,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514683884] [2025-03-13 22:24:55,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:55,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:55,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-13 22:24:55,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-13 22:24:55,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:55,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:56,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:56,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514683884] [2025-03-13 22:24:56,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514683884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:56,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:56,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964543237] [2025-03-13 22:24:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:56,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:56,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:56,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:56,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-03-13 22:24:56,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 612 transitions, 1320 flow. Second operand has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:56,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:56,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-03-13 22:24:56,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:57,114 INFO L124 PetriNetUnfolderBase]: 160/4614 cut-off events. [2025-03-13 22:24:57,115 INFO L125 PetriNetUnfolderBase]: For 62/70 co-relation queries the response was YES. [2025-03-13 22:24:57,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 4614 events. 160/4614 cut-off events. For 62/70 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 39506 event pairs, 0 based on Foata normal form. 0/4242 useless extension candidates. Maximal degree in co-relation 5224. Up to 171 conditions per place. [2025-03-13 22:24:57,161 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/613 dead transitions. [2025-03-13 22:24:57,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 613 transitions, 1388 flow [2025-03-13 22:24:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:24:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:24:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-03-13 22:24:57,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-03-13 22:24:57,168 INFO L175 Difference]: Start difference. First operand has 614 places, 612 transitions, 1320 flow. Second operand 6 states and 3940 transitions. [2025-03-13 22:24:57,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 613 transitions, 1388 flow [2025-03-13 22:24:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 613 transitions, 1378 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:24:57,178 INFO L231 Difference]: Finished difference. Result has 611 places, 609 transitions, 1314 flow [2025-03-13 22:24:57,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=611, PETRI_TRANSITIONS=609} [2025-03-13 22:24:57,179 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -51 predicate places. [2025-03-13 22:24:57,180 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 609 transitions, 1314 flow [2025-03-13 22:24:57,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:57,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:57,181 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-13 22:24:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:24:57,181 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:57,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash -298536821, now seen corresponding path program 1 times [2025-03-13 22:24:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787887316] [2025-03-13 22:24:57,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-13 22:24:57,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-13 22:24:57,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:57,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787887316] [2025-03-13 22:24:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787887316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:57,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428177022] [2025-03-13 22:24:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:57,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:57,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:57,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:57,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-13 22:24:57,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 609 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:57,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:57,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-13 22:24:57,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:57,964 INFO L124 PetriNetUnfolderBase]: 208/6152 cut-off events. [2025-03-13 22:24:57,965 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-13 22:24:57,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 6152 events. 208/6152 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 53530 event pairs, 32 based on Foata normal form. 0/5663 useless extension candidates. Maximal degree in co-relation 6969. Up to 163 conditions per place. [2025-03-13 22:24:57,997 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2025-03-13 22:24:57,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 609 transitions, 1345 flow [2025-03-13 22:24:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-13 22:24:57,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-13 22:24:57,999 INFO L175 Difference]: Start difference. First operand has 611 places, 609 transitions, 1314 flow. Second operand 3 states and 2015 transitions. [2025-03-13 22:24:57,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 609 transitions, 1345 flow [2025-03-13 22:24:58,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 609 transitions, 1335 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:24:58,006 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1306 flow [2025-03-13 22:24:58,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=607, PETRI_TRANSITIONS=608} [2025-03-13 22:24:58,007 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-13 22:24:58,007 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1306 flow [2025-03-13 22:24:58,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:58,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:58,008 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-13 22:24:58,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:24:58,008 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:58,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1778470185, now seen corresponding path program 1 times [2025-03-13 22:24:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107017410] [2025-03-13 22:24:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:58,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-13 22:24:58,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-13 22:24:58,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:24:58,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107017410] [2025-03-13 22:24:58,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107017410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:58,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:58,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456818062] [2025-03-13 22:24:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:58,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:58,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:58,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:58,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:58,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-03-13 22:24:58,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 608 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:58,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:58,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-03-13 22:24:58,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:58,682 INFO L124 PetriNetUnfolderBase]: 145/6333 cut-off events. [2025-03-13 22:24:58,682 INFO L125 PetriNetUnfolderBase]: For 20/24 co-relation queries the response was YES. [2025-03-13 22:24:58,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 6333 events. 145/6333 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 54657 event pairs, 4 based on Foata normal form. 0/5861 useless extension candidates. Maximal degree in co-relation 6849. Up to 68 conditions per place. [2025-03-13 22:24:58,717 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 8 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2025-03-13 22:24:58,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 610 transitions, 1330 flow [2025-03-13 22:24:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2032 transitions. [2025-03-13 22:24:58,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607565011820332 [2025-03-13 22:24:58,719 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1306 flow. Second operand 3 states and 2032 transitions. [2025-03-13 22:24:58,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 610 transitions, 1330 flow [2025-03-13 22:24:58,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 610 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:58,726 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1307 flow [2025-03-13 22:24:58,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1307, PETRI_PLACES=607, PETRI_TRANSITIONS=608} [2025-03-13 22:24:58,726 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-13 22:24:58,726 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1307 flow [2025-03-13 22:24:58,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:58,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:58,727 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-13 22:24:58,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:24:58,727 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:58,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1136686709, now seen corresponding path program 1 times [2025-03-13 22:24:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150672578] [2025-03-13 22:24:58,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:58,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-13 22:24:58,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-13 22:24:58,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:58,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150672578] [2025-03-13 22:24:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150672578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:58,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:58,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059164444] [2025-03-13 22:24:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:58,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:58,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:58,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-13 22:24:58,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 608 transitions, 1307 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:58,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:58,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-13 22:24:58,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:59,423 INFO L124 PetriNetUnfolderBase]: 143/5379 cut-off events. [2025-03-13 22:24:59,423 INFO L125 PetriNetUnfolderBase]: For 99/107 co-relation queries the response was YES. [2025-03-13 22:24:59,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 5379 events. 143/5379 cut-off events. For 99/107 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 43355 event pairs, 18 based on Foata normal form. 0/4984 useless extension candidates. Maximal degree in co-relation 5921. Up to 154 conditions per place. [2025-03-13 22:24:59,447 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 12 selfloop transitions, 2 changer transitions 1/608 dead transitions. [2025-03-13 22:24:59,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 608 transitions, 1338 flow [2025-03-13 22:24:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-13 22:24:59,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-13 22:24:59,450 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1307 flow. Second operand 3 states and 2015 transitions. [2025-03-13 22:24:59,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 608 transitions, 1338 flow [2025-03-13 22:24:59,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 608 transitions, 1338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:59,455 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1309 flow [2025-03-13 22:24:59,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1309, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2025-03-13 22:24:59,456 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-13 22:24:59,456 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1309 flow [2025-03-13 22:24:59,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:59,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:59,457 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] [2025-03-13 22:24:59,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:24:59,457 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:24:59,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash 952893139, now seen corresponding path program 1 times [2025-03-13 22:24:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404291913] [2025-03-13 22:24:59,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:59,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-13 22:24:59,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-13 22:24:59,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:59,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:59,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:59,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404291913] [2025-03-13 22:24:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404291913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457976845] [2025-03-13 22:24:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:59,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:59,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:59,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:59,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-03-13 22:24:59,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:59,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:59,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-03-13 22:24:59,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:00,280 INFO L124 PetriNetUnfolderBase]: 135/6249 cut-off events. [2025-03-13 22:25:00,280 INFO L125 PetriNetUnfolderBase]: For 30/38 co-relation queries the response was YES. [2025-03-13 22:25:00,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6859 conditions, 6249 events. 135/6249 cut-off events. For 30/38 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 51950 event pairs, 8 based on Foata normal form. 0/5823 useless extension candidates. Maximal degree in co-relation 6753. Up to 68 conditions per place. [2025-03-13 22:25:00,306 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 7 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2025-03-13 22:25:00,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 608 transitions, 1328 flow [2025-03-13 22:25:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2025-03-13 22:25:00,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602836879432625 [2025-03-13 22:25:00,309 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1309 flow. Second operand 3 states and 2031 transitions. [2025-03-13 22:25:00,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 608 transitions, 1328 flow [2025-03-13 22:25:00,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 608 transitions, 1324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:00,314 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1310 flow [2025-03-13 22:25:00,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2025-03-13 22:25:00,315 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-13 22:25:00,315 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1310 flow [2025-03-13 22:25:00,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:00,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:00,316 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, 1, 1, 1, 1, 1] [2025-03-13 22:25:00,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:25:00,316 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -57535030, now seen corresponding path program 1 times [2025-03-13 22:25:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824217877] [2025-03-13 22:25:00,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:00,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-13 22:25:00,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-13 22:25:00,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:00,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:25:00,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824217877] [2025-03-13 22:25:00,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824217877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:00,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:00,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867391042] [2025-03-13 22:25:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:00,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:00,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:00,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:00,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-13 22:25:00,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:00,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:00,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-13 22:25:00,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:01,695 INFO L124 PetriNetUnfolderBase]: 231/8833 cut-off events. [2025-03-13 22:25:01,696 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 22:25:01,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 8833 events. 231/8833 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 81004 event pairs, 36 based on Foata normal form. 0/8211 useless extension candidates. Maximal degree in co-relation 9728. Up to 159 conditions per place. [2025-03-13 22:25:01,756 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2025-03-13 22:25:01,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 607 transitions, 1341 flow [2025-03-13 22:25:01,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-13 22:25:01,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-13 22:25:01,760 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1310 flow. Second operand 3 states and 2015 transitions. [2025-03-13 22:25:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 607 transitions, 1341 flow [2025-03-13 22:25:01,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 607 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:25:01,769 INFO L231 Difference]: Finished difference. Result has 609 places, 606 transitions, 1312 flow [2025-03-13 22:25:01,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=609, PETRI_TRANSITIONS=606} [2025-03-13 22:25:01,769 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -53 predicate places. [2025-03-13 22:25:01,770 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 606 transitions, 1312 flow [2025-03-13 22:25:01,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:01,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:01,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:25:01,770 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -841480642, now seen corresponding path program 1 times [2025-03-13 22:25:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689424576] [2025-03-13 22:25:01,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:01,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-13 22:25:01,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-13 22:25:01,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:01,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:01,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689424576] [2025-03-13 22:25:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689424576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:01,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:01,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899970648] [2025-03-13 22:25:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:01,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:01,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:01,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:01,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-13 22:25:01,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 606 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:01,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:01,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-13 22:25:01,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:02,659 INFO L124 PetriNetUnfolderBase]: 147/6049 cut-off events. [2025-03-13 22:25:02,659 INFO L125 PetriNetUnfolderBase]: For 105/113 co-relation queries the response was YES. [2025-03-13 22:25:02,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 6049 events. 147/6049 cut-off events. For 105/113 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 50424 event pairs, 22 based on Foata normal form. 0/5641 useless extension candidates. Maximal degree in co-relation 6648. Up to 150 conditions per place. [2025-03-13 22:25:02,713 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2025-03-13 22:25:02,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 606 transitions, 1343 flow [2025-03-13 22:25:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-13 22:25:02,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-13 22:25:02,715 INFO L175 Difference]: Start difference. First operand has 609 places, 606 transitions, 1312 flow. Second operand 3 states and 2015 transitions. [2025-03-13 22:25:02,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 606 transitions, 1343 flow [2025-03-13 22:25:02,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 606 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:02,722 INFO L231 Difference]: Finished difference. Result has 608 places, 605 transitions, 1310 flow [2025-03-13 22:25:02,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=605} [2025-03-13 22:25:02,723 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-13 22:25:02,723 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 605 transitions, 1310 flow [2025-03-13 22:25:02,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:02,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:02,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:25:02,724 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:02,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash -547967891, now seen corresponding path program 1 times [2025-03-13 22:25:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:02,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059372812] [2025-03-13 22:25:02,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:02,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-13 22:25:02,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-13 22:25:02,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:02,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:25:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059372812] [2025-03-13 22:25:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059372812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:02,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:02,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998003215] [2025-03-13 22:25:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:02,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:02,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:02,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:02,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-03-13 22:25:02,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 605 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:02,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-03-13 22:25:02,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:04,148 INFO L124 PetriNetUnfolderBase]: 281/10327 cut-off events. [2025-03-13 22:25:04,148 INFO L125 PetriNetUnfolderBase]: For 90/94 co-relation queries the response was YES. [2025-03-13 22:25:04,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11638 conditions, 10327 events. 281/10327 cut-off events. For 90/94 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 101527 event pairs, 64 based on Foata normal form. 0/9630 useless extension candidates. Maximal degree in co-relation 11531. Up to 254 conditions per place. [2025-03-13 22:25:04,243 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2025-03-13 22:25:04,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 605 transitions, 1355 flow [2025-03-13 22:25:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-03-13 22:25:04,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-03-13 22:25:04,246 INFO L175 Difference]: Start difference. First operand has 608 places, 605 transitions, 1310 flow. Second operand 3 states and 2004 transitions. [2025-03-13 22:25:04,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 605 transitions, 1355 flow [2025-03-13 22:25:04,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 605 transitions, 1351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:04,253 INFO L231 Difference]: Finished difference. Result has 607 places, 604 transitions, 1308 flow [2025-03-13 22:25:04,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=607, PETRI_TRANSITIONS=604} [2025-03-13 22:25:04,254 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-13 22:25:04,254 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 604 transitions, 1308 flow [2025-03-13 22:25:04,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:04,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:04,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:25:04,255 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:04,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1863301089, now seen corresponding path program 1 times [2025-03-13 22:25:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:04,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473763989] [2025-03-13 22:25:04,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:04,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-13 22:25:04,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-13 22:25:04,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:04,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:04,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:04,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473763989] [2025-03-13 22:25:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473763989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:04,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:04,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787693288] [2025-03-13 22:25:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:04,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:04,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:04,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:04,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-13 22:25:04,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 604 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:04,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-13 22:25:04,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:05,189 INFO L124 PetriNetUnfolderBase]: 163/6447 cut-off events. [2025-03-13 22:25:05,189 INFO L125 PetriNetUnfolderBase]: For 111/119 co-relation queries the response was YES. [2025-03-13 22:25:05,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7257 conditions, 6447 events. 163/6447 cut-off events. For 111/119 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 56131 event pairs, 36 based on Foata normal form. 0/6034 useless extension candidates. Maximal degree in co-relation 7150. Up to 199 conditions per place. [2025-03-13 22:25:05,246 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2025-03-13 22:25:05,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 604 transitions, 1343 flow [2025-03-13 22:25:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-13 22:25:05,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-13 22:25:05,249 INFO L175 Difference]: Start difference. First operand has 607 places, 604 transitions, 1308 flow. Second operand 3 states and 2014 transitions. [2025-03-13 22:25:05,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 604 transitions, 1343 flow [2025-03-13 22:25:05,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 604 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:05,255 INFO L231 Difference]: Finished difference. Result has 606 places, 603 transitions, 1306 flow [2025-03-13 22:25:05,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=606, PETRI_TRANSITIONS=603} [2025-03-13 22:25:05,256 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-03-13 22:25:05,256 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 603 transitions, 1306 flow [2025-03-13 22:25:05,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:05,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:05,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:05,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:25:05,257 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:05,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:05,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1250973893, now seen corresponding path program 1 times [2025-03-13 22:25:05,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:05,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548100871] [2025-03-13 22:25:05,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:05,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-13 22:25:05,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-13 22:25:05,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:05,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:25:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:05,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548100871] [2025-03-13 22:25:05,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548100871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:05,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:05,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:05,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968425574] [2025-03-13 22:25:05,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:05,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:05,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:05,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:05,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:05,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-03-13 22:25:05,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 603 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:05,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:05,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-03-13 22:25:05,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:06,648 INFO L124 PetriNetUnfolderBase]: 283/10615 cut-off events. [2025-03-13 22:25:06,649 INFO L125 PetriNetUnfolderBase]: For 121/129 co-relation queries the response was YES. [2025-03-13 22:25:06,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11964 conditions, 10615 events. 283/10615 cut-off events. For 121/129 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102977 event pairs, 56 based on Foata normal form. 0/9921 useless extension candidates. Maximal degree in co-relation 11857. Up to 246 conditions per place. [2025-03-13 22:25:06,722 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2025-03-13 22:25:06,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 603 transitions, 1351 flow [2025-03-13 22:25:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-03-13 22:25:06,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-03-13 22:25:06,723 INFO L175 Difference]: Start difference. First operand has 606 places, 603 transitions, 1306 flow. Second operand 3 states and 2004 transitions. [2025-03-13 22:25:06,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 603 transitions, 1351 flow [2025-03-13 22:25:06,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 603 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:06,730 INFO L231 Difference]: Finished difference. Result has 605 places, 602 transitions, 1304 flow [2025-03-13 22:25:06,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=605, PETRI_TRANSITIONS=602} [2025-03-13 22:25:06,731 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -57 predicate places. [2025-03-13 22:25:06,731 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 602 transitions, 1304 flow [2025-03-13 22:25:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:06,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:06,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:25:06,732 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -379482824, now seen corresponding path program 1 times [2025-03-13 22:25:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709133754] [2025-03-13 22:25:06,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:06,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-13 22:25:06,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-13 22:25:06,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:06,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:25:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709133754] [2025-03-13 22:25:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709133754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:06,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:06,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657762936] [2025-03-13 22:25:06,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:06,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:06,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:06,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:06,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:06,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-13 22:25:06,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 602 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:06,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:06,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-13 22:25:06,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:07,603 INFO L124 PetriNetUnfolderBase]: 233/7345 cut-off events. [2025-03-13 22:25:07,603 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-13 22:25:07,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8396 conditions, 7345 events. 233/7345 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 66980 event pairs, 76 based on Foata normal form. 0/6909 useless extension candidates. Maximal degree in co-relation 8328. Up to 266 conditions per place. [2025-03-13 22:25:07,681 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-03-13 22:25:07,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 602 transitions, 1337 flow [2025-03-13 22:25:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-13 22:25:07,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-13 22:25:07,683 INFO L175 Difference]: Start difference. First operand has 605 places, 602 transitions, 1304 flow. Second operand 3 states and 2014 transitions. [2025-03-13 22:25:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 602 transitions, 1337 flow [2025-03-13 22:25:07,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 602 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:07,691 INFO L231 Difference]: Finished difference. Result has 604 places, 601 transitions, 1302 flow [2025-03-13 22:25:07,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1302, PETRI_PLACES=604, PETRI_TRANSITIONS=601} [2025-03-13 22:25:07,692 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -58 predicate places. [2025-03-13 22:25:07,692 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 601 transitions, 1302 flow [2025-03-13 22:25:07,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:07,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:07,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:07,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:25:07,693 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:07,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash 407948719, now seen corresponding path program 1 times [2025-03-13 22:25:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:07,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236199380] [2025-03-13 22:25:07,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:07,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-13 22:25:07,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-13 22:25:07,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:07,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:07,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236199380] [2025-03-13 22:25:07,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236199380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:07,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:07,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:07,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518348181] [2025-03-13 22:25:07,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:07,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:07,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:07,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:07,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:07,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-13 22:25:07,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 601 transitions, 1302 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:07,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:07,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-13 22:25:07,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:08,626 INFO L124 PetriNetUnfolderBase]: 155/6417 cut-off events. [2025-03-13 22:25:08,626 INFO L125 PetriNetUnfolderBase]: For 113/121 co-relation queries the response was YES. [2025-03-13 22:25:08,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 6417 events. 155/6417 cut-off events. For 113/121 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 55403 event pairs, 32 based on Foata normal form. 0/6029 useless extension candidates. Maximal degree in co-relation 7082. Up to 185 conditions per place. [2025-03-13 22:25:08,665 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-03-13 22:25:08,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 601 transitions, 1337 flow [2025-03-13 22:25:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-13 22:25:08,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-13 22:25:08,667 INFO L175 Difference]: Start difference. First operand has 604 places, 601 transitions, 1302 flow. Second operand 3 states and 2014 transitions. [2025-03-13 22:25:08,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 601 transitions, 1337 flow [2025-03-13 22:25:08,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:08,672 INFO L231 Difference]: Finished difference. Result has 603 places, 600 transitions, 1300 flow [2025-03-13 22:25:08,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=603, PETRI_TRANSITIONS=600} [2025-03-13 22:25:08,673 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -59 predicate places. [2025-03-13 22:25:08,674 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 600 transitions, 1300 flow [2025-03-13 22:25:08,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:08,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:08,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:08,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:25:08,675 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-13 22:25:08,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 412287596, now seen corresponding path program 1 times [2025-03-13 22:25:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:08,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87442715] [2025-03-13 22:25:08,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:08,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-13 22:25:08,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-13 22:25:08,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:08,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:08,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:08,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87442715] [2025-03-13 22:25:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87442715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:08,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642865278] [2025-03-13 22:25:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:08,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:08,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:08,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:08,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-13 22:25:08,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 600 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:08,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:08,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-13 22:25:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:09,536 INFO L124 PetriNetUnfolderBase]: 175/6445 cut-off events. [2025-03-13 22:25:09,536 INFO L125 PetriNetUnfolderBase]: For 92/100 co-relation queries the response was YES. [2025-03-13 22:25:09,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 6445 events. 175/6445 cut-off events. For 92/100 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 56845 event pairs, 42 based on Foata normal form. 0/6066 useless extension candidates. Maximal degree in co-relation 7248. Up to 258 conditions per place. [2025-03-13 22:25:09,580 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 0 selfloop transitions, 0 changer transitions 600/600 dead transitions. [2025-03-13 22:25:09,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 600 transitions, 1333 flow [2025-03-13 22:25:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-13 22:25:09,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-13 22:25:09,581 INFO L175 Difference]: Start difference. First operand has 603 places, 600 transitions, 1300 flow. Second operand 3 states and 2014 transitions. [2025-03-13 22:25:09,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 600 transitions, 1333 flow [2025-03-13 22:25:09,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 600 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:09,586 INFO L231 Difference]: Finished difference. Result has 602 places, 0 transitions, 0 flow [2025-03-13 22:25:09,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=602, PETRI_TRANSITIONS=0} [2025-03-13 22:25:09,587 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -60 predicate places. [2025-03-13 22:25:09,587 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 0 transitions, 0 flow [2025-03-13 22:25:09,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:09,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (122 of 123 remaining) [2025-03-13 22:25:09,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (121 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (120 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (119 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (118 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (117 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (116 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (115 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (114 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (113 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (112 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (108 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (107 of 123 remaining) [2025-03-13 22:25:09,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (106 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (105 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (104 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (103 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (102 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (101 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (100 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (98 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (97 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (96 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (95 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (94 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (93 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (92 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (91 of 123 remaining) [2025-03-13 22:25:09,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (89 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (88 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (87 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (86 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (85 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (84 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (83 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (82 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (81 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (80 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (79 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (77 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (76 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (75 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (74 of 123 remaining) [2025-03-13 22:25:09,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (73 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (72 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (71 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (70 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (69 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (68 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (67 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (66 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (63 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (61 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (60 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (59 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (57 of 123 remaining) [2025-03-13 22:25:09,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (56 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (55 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (53 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (47 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (45 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (43 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (42 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (41 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (40 of 123 remaining) [2025-03-13 22:25:09,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (39 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (38 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (36 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (32 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (31 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (30 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (28 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (27 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (21 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (19 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (17 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (16 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (12 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (10 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (6 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 123 remaining) [2025-03-13 22:25:09,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (4 of 123 remaining) [2025-03-13 22:25:09,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 123 remaining) [2025-03-13 22:25:09,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 123 remaining) [2025-03-13 22:25:09,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 123 remaining) [2025-03-13 22:25:09,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 123 remaining) [2025-03-13 22:25:09,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:25:09,596 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-13 22:25:09,600 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:25:09,600 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:25:09,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:25:09 BasicIcfg [2025-03-13 22:25:09,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:25:09,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:25:09,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:25:09,606 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:25:09,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:24:46" (3/4) ... [2025-03-13 22:25:09,608 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:25:09,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:25:09,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:25:09,615 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-13 22:25:09,615 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:25:09,616 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:25:09,616 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:25:09,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:25:09,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:25:09,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:25:09,687 INFO L158 Benchmark]: Toolchain (without parser) took 24499.18ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 125.6MB in the beginning and 418.7MB in the end (delta: -293.0MB). Peak memory consumption was 728.9MB. Max. memory is 16.1GB. [2025-03-13 22:25:09,687 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:25:09,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.36ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 111.8MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:09,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.58ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 108.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:09,688 INFO L158 Benchmark]: Boogie Preprocessor took 45.88ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:25:09,688 INFO L158 Benchmark]: IcfgBuilder took 791.29ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 63.0MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 22:25:09,688 INFO L158 Benchmark]: TraceAbstraction took 23296.18ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 62.3MB in the beginning and 423.0MB in the end (delta: -360.7MB). Peak memory consumption was 661.8MB. Max. memory is 16.1GB. [2025-03-13 22:25:09,689 INFO L158 Benchmark]: Witness Printer took 79.19ms. Allocated memory is still 1.2GB. Free memory was 423.0MB in the beginning and 418.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:09,690 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.36ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 111.8MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.58ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 108.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.88ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 791.29ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 63.0MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23296.18ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 62.3MB in the beginning and 423.0MB in the end (delta: -360.7MB). Peak memory consumption was 661.8MB. Max. memory is 16.1GB. * Witness Printer took 79.19ms. Allocated memory is still 1.2GB. Free memory was 423.0MB in the beginning and 418.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1100 locations, 123 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.1s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1866 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 311 mSDtfsCounter, 2136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1384occurred in iteration=0, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 4931 NumberOfCodeBlocks, 4931 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4898 ConstructedInterpolants, 0 QuantifiedInterpolants, 5303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 73 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:25:09,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE