./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 22:06:19,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:06:20,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:06:20,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:06:20,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:06:20,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:06:20,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:06:20,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:06:20,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:06:20,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:06:20,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:06:20,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:06:20,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:06:20,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:06:20,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:06:20,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:06:20,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:06:20,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:06:20,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:06:20,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:06:20,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:06:20,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:06:20,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:06:20,090 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-08 22:06:20,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:06:20,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:06:20,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:06:20,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:06:20,351 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:06:20,352 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-08 22:06:21,572 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1201987/501f5fb0e52c40368b981ce43b967eb1/FLAG8fe48ce9a [2025-03-08 22:06:21,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:06:21,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-08 22:06:21,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1201987/501f5fb0e52c40368b981ce43b967eb1/FLAG8fe48ce9a [2025-03-08 22:06:22,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1201987/501f5fb0e52c40368b981ce43b967eb1 [2025-03-08 22:06:22,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:06:22,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:06:22,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:06:22,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:06:22,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:06:22,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5ef258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22, skipping insertion in model container [2025-03-08 22:06:22,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:06:22,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:06:22,333 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:06:22,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:06:22,377 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:06:22,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22 WrapperNode [2025-03-08 22:06:22,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:06:22,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:06:22,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:06:22,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:06:22,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,429 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 503 [2025-03-08 22:06:22,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:06:22,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:06:22,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:06:22,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:06:22,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:06:22,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:06:22,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:06:22,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:06:22,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (1/1) ... [2025-03-08 22:06:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:06:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:06:22,507 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-08 22:06:22,509 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-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:06:22,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:06:22,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:06:22,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:06:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:06:22,528 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:06:22,638 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:06:22,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:06:23,334 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:06:23,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:06:23,359 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:06:23,362 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:06:23,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:06:23 BoogieIcfgContainer [2025-03-08 22:06:23,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:06:23,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:06:23,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:06:23,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:06:23,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:06:22" (1/3) ... [2025-03-08 22:06:23,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716a03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:06:23, skipping insertion in model container [2025-03-08 22:06:23,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:06:22" (2/3) ... [2025-03-08 22:06:23,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716a03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:06:23, skipping insertion in model container [2025-03-08 22:06:23,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:06:23" (3/3) ... [2025-03-08 22:06:23,371 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-03-08 22:06:23,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:06:23,384 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-08 22:06:23,384 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:06:23,518 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:06:23,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 680 places, 705 transitions, 1424 flow [2025-03-08 22:06:23,752 INFO L124 PetriNetUnfolderBase]: 32/703 cut-off events. [2025-03-08 22:06:23,754 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:06:23,766 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-08 22:06:23,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 680 places, 705 transitions, 1424 flow [2025-03-08 22:06:23,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 662 places, 686 transitions, 1384 flow [2025-03-08 22:06:23,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:06:23,799 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;@45cdebc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:06:23,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 123 error locations. [2025-03-08 22:06:23,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:06:23,805 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-08 22:06:23,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:06:23,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:23,806 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-08 22:06:23,806 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-08 22:06:23,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1434984346, now seen corresponding path program 1 times [2025-03-08 22:06:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:23,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560502581] [2025-03-08 22:06:23,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:23,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:23,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:06:23,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:06:23,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:23,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:23,945 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-08 22:06:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:23,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560502581] [2025-03-08 22:06:23,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560502581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:23,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:23,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601737610] [2025-03-08 22:06:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:23,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:23,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:23,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:24,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-03-08 22:06:24,039 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-08 22:06:24,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:24,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-03-08 22:06:24,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:24,341 INFO L124 PetriNetUnfolderBase]: 28/1966 cut-off events. [2025-03-08 22:06:24,342 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-08 22:06:24,353 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-08 22:06:24,362 INFO L140 encePairwiseOnDemand]: 681/705 looper letters, 19 selfloop transitions, 2 changer transitions 3/664 dead transitions. [2025-03-08 22:06:24,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 664 transitions, 1382 flow [2025-03-08 22:06:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2020 transitions. [2025-03-08 22:06:24,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550827423167849 [2025-03-08 22:06:24,377 INFO L175 Difference]: Start difference. First operand has 662 places, 686 transitions, 1384 flow. Second operand 3 states and 2020 transitions. [2025-03-08 22:06:24,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 664 transitions, 1382 flow [2025-03-08 22:06:24,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 664 transitions, 1374 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:06:24,397 INFO L231 Difference]: Finished difference. Result has 659 places, 661 transitions, 1330 flow [2025-03-08 22:06:24,400 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-08 22:06:24,403 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -3 predicate places. [2025-03-08 22:06:24,403 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 661 transitions, 1330 flow [2025-03-08 22:06:24,405 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-08 22:06:24,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:24,405 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-08 22:06:24,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:06:24,405 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-08 22:06:24,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash -462712004, now seen corresponding path program 1 times [2025-03-08 22:06:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:24,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587480481] [2025-03-08 22:06:24,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:24,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:06:24,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:06:24,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:24,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:24,463 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-08 22:06:24,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:24,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587480481] [2025-03-08 22:06:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587480481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:24,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693288257] [2025-03-08 22:06:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:24,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-08 22:06:24,521 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-08 22:06:24,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:24,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-08 22:06:24,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:24,656 INFO L124 PetriNetUnfolderBase]: 19/880 cut-off events. [2025-03-08 22:06:24,656 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-08 22:06:24,666 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-08 22:06:24,671 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/660 dead transitions. [2025-03-08 22:06:24,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 660 transitions, 1360 flow [2025-03-08 22:06:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-08 22:06:24,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-08 22:06:24,676 INFO L175 Difference]: Start difference. First operand has 659 places, 661 transitions, 1330 flow. Second operand 3 states and 2009 transitions. [2025-03-08 22:06:24,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 660 transitions, 1360 flow [2025-03-08 22:06:24,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 660 transitions, 1356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:24,685 INFO L231 Difference]: Finished difference. Result has 655 places, 660 transitions, 1328 flow [2025-03-08 22:06:24,686 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-08 22:06:24,687 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -7 predicate places. [2025-03-08 22:06:24,687 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 660 transitions, 1328 flow [2025-03-08 22:06:24,688 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-08 22:06:24,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:24,688 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-08 22:06:24,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:06:24,689 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-08 22:06:24,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash 958158355, now seen corresponding path program 1 times [2025-03-08 22:06:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385933258] [2025-03-08 22:06:24,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:24,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:06:24,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:06:24,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:24,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:24,741 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-08 22:06:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385933258] [2025-03-08 22:06:24,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385933258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:24,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:24,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394818605] [2025-03-08 22:06:24,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:24,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:24,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:24,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-03-08 22:06:24,756 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-08 22:06:24,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:24,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-03-08 22:06:24,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:24,886 INFO L124 PetriNetUnfolderBase]: 13/876 cut-off events. [2025-03-08 22:06:24,886 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-08 22:06:24,894 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-08 22:06:24,899 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/659 dead transitions. [2025-03-08 22:06:24,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 659 transitions, 1346 flow [2025-03-08 22:06:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-03-08 22:06:24,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-03-08 22:06:24,934 INFO L175 Difference]: Start difference. First operand has 655 places, 660 transitions, 1328 flow. Second operand 3 states and 2021 transitions. [2025-03-08 22:06:24,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 659 transitions, 1346 flow [2025-03-08 22:06:24,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 659 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:24,942 INFO L231 Difference]: Finished difference. Result has 654 places, 659 transitions, 1326 flow [2025-03-08 22:06:24,943 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-08 22:06:24,945 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -8 predicate places. [2025-03-08 22:06:24,945 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 659 transitions, 1326 flow [2025-03-08 22:06:24,946 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-08 22:06:24,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:24,946 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-08 22:06:24,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:06:24,946 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-08 22:06:24,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 193961989, now seen corresponding path program 1 times [2025-03-08 22:06:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149221165] [2025-03-08 22:06:24,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:24,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:06:24,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:06:24,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:24,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149221165] [2025-03-08 22:06:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149221165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869823771] [2025-03-08 22:06:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:25,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:25,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:25,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:25,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-03-08 22:06:25,019 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-08 22:06:25,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:25,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-03-08 22:06:25,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:25,103 INFO L124 PetriNetUnfolderBase]: 11/660 cut-off events. [2025-03-08 22:06:25,104 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-08 22:06:25,109 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-08 22:06:25,116 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/658 dead transitions. [2025-03-08 22:06:25,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 658 transitions, 1344 flow [2025-03-08 22:06:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-03-08 22:06:25,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-03-08 22:06:25,120 INFO L175 Difference]: Start difference. First operand has 654 places, 659 transitions, 1326 flow. Second operand 3 states and 2021 transitions. [2025-03-08 22:06:25,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 658 transitions, 1344 flow [2025-03-08 22:06:25,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 658 transitions, 1340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:25,131 INFO L231 Difference]: Finished difference. Result has 653 places, 658 transitions, 1324 flow [2025-03-08 22:06:25,131 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-08 22:06:25,132 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -9 predicate places. [2025-03-08 22:06:25,132 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 658 transitions, 1324 flow [2025-03-08 22:06:25,133 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-08 22:06:25,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:25,133 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-08 22:06:25,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:06:25,134 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-08 22:06:25,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1990451773, now seen corresponding path program 1 times [2025-03-08 22:06:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203452320] [2025-03-08 22:06:25,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:25,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:06:25,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:06:25,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:25,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:25,174 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-08 22:06:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203452320] [2025-03-08 22:06:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203452320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:25,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141591652] [2025-03-08 22:06:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:25,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:25,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:25,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:25,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-08 22:06:25,215 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-08 22:06:25,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:25,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-08 22:06:25,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:25,367 INFO L124 PetriNetUnfolderBase]: 22/1525 cut-off events. [2025-03-08 22:06:25,367 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-08 22:06:25,375 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-08 22:06:25,380 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/657 dead transitions. [2025-03-08 22:06:25,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 657 transitions, 1352 flow [2025-03-08 22:06:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-08 22:06:25,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-08 22:06:25,383 INFO L175 Difference]: Start difference. First operand has 653 places, 658 transitions, 1324 flow. Second operand 3 states and 2011 transitions. [2025-03-08 22:06:25,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 657 transitions, 1352 flow [2025-03-08 22:06:25,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 657 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:25,390 INFO L231 Difference]: Finished difference. Result has 652 places, 657 transitions, 1322 flow [2025-03-08 22:06:25,391 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-08 22:06:25,392 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -10 predicate places. [2025-03-08 22:06:25,392 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 657 transitions, 1322 flow [2025-03-08 22:06:25,394 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-08 22:06:25,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:25,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:06:25,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:06:25,395 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-08 22:06:25,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -598585748, now seen corresponding path program 1 times [2025-03-08 22:06:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:25,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319030529] [2025-03-08 22:06:25,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:25,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:06:25,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:06:25,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:25,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:25,443 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-08 22:06:25,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:25,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319030529] [2025-03-08 22:06:25,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319030529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:25,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056920574] [2025-03-08 22:06:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:25,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:25,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:25,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:25,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:25,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-08 22:06:25,498 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-08 22:06:25,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:25,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-08 22:06:25,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:25,590 INFO L124 PetriNetUnfolderBase]: 14/701 cut-off events. [2025-03-08 22:06:25,590 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-08 22:06:25,595 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-08 22:06:25,597 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/656 dead transitions. [2025-03-08 22:06:25,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 656 transitions, 1350 flow [2025-03-08 22:06:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-08 22:06:25,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-08 22:06:25,601 INFO L175 Difference]: Start difference. First operand has 652 places, 657 transitions, 1322 flow. Second operand 3 states and 2011 transitions. [2025-03-08 22:06:25,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 656 transitions, 1350 flow [2025-03-08 22:06:25,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 656 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:25,608 INFO L231 Difference]: Finished difference. Result has 651 places, 656 transitions, 1320 flow [2025-03-08 22:06:25,608 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-08 22:06:25,609 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -11 predicate places. [2025-03-08 22:06:25,609 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 656 transitions, 1320 flow [2025-03-08 22:06:25,610 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-08 22:06:25,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:25,610 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-08 22:06:25,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:06:25,611 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-08 22:06:25,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1875839642, now seen corresponding path program 1 times [2025-03-08 22:06:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257417647] [2025-03-08 22:06:25,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:25,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 22:06:25,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 22:06:25,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:25,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:25,665 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-08 22:06:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:25,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257417647] [2025-03-08 22:06:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257417647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420298017] [2025-03-08 22:06:25,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:25,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:25,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:25,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:25,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:25,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-08 22:06:25,699 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-08 22:06:25,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:25,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-08 22:06:25,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:25,786 INFO L124 PetriNetUnfolderBase]: 18/874 cut-off events. [2025-03-08 22:06:25,786 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:06:25,792 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-08 22:06:25,795 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2025-03-08 22:06:25,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 655 transitions, 1350 flow [2025-03-08 22:06:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-08 22:06:25,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-08 22:06:25,799 INFO L175 Difference]: Start difference. First operand has 651 places, 656 transitions, 1320 flow. Second operand 3 states and 2009 transitions. [2025-03-08 22:06:25,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 655 transitions, 1350 flow [2025-03-08 22:06:25,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 655 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:25,805 INFO L231 Difference]: Finished difference. Result has 650 places, 655 transitions, 1318 flow [2025-03-08 22:06:25,806 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-08 22:06:25,808 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -12 predicate places. [2025-03-08 22:06:25,808 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 655 transitions, 1318 flow [2025-03-08 22:06:25,809 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-08 22:06:25,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:25,809 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-08 22:06:25,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:06:25,809 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-08 22:06:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash 285013060, now seen corresponding path program 1 times [2025-03-08 22:06:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554706550] [2025-03-08 22:06:25,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:25,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 22:06:25,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 22:06:25,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:25,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:25,849 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-08 22:06:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:25,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554706550] [2025-03-08 22:06:25,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554706550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:25,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:25,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19508396] [2025-03-08 22:06:25,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:25,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:25,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:25,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:25,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-08 22:06:25,888 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-08 22:06:25,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:25,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-08 22:06:25,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:25,991 INFO L124 PetriNetUnfolderBase]: 18/873 cut-off events. [2025-03-08 22:06:25,991 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-08 22:06:25,998 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-08 22:06:26,002 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/654 dead transitions. [2025-03-08 22:06:26,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 654 transitions, 1348 flow [2025-03-08 22:06:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-08 22:06:26,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-08 22:06:26,006 INFO L175 Difference]: Start difference. First operand has 650 places, 655 transitions, 1318 flow. Second operand 3 states and 2009 transitions. [2025-03-08 22:06:26,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 654 transitions, 1348 flow [2025-03-08 22:06:26,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 654 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:26,015 INFO L231 Difference]: Finished difference. Result has 649 places, 654 transitions, 1316 flow [2025-03-08 22:06:26,016 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-08 22:06:26,017 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -13 predicate places. [2025-03-08 22:06:26,017 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 654 transitions, 1316 flow [2025-03-08 22:06:26,018 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-08 22:06:26,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:26,018 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-08 22:06:26,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:06:26,018 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-08 22:06:26,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash 659888565, now seen corresponding path program 1 times [2025-03-08 22:06:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:26,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305263009] [2025-03-08 22:06:26,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:26,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 22:06:26,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 22:06:26,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:26,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:26,061 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-08 22:06:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:26,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305263009] [2025-03-08 22:06:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305263009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:26,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711454197] [2025-03-08 22:06:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:26,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:26,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:26,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:26,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-08 22:06:26,083 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-08 22:06:26,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:26,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-08 22:06:26,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:26,210 INFO L124 PetriNetUnfolderBase]: 17/1083 cut-off events. [2025-03-08 22:06:26,211 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:06:26,218 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-08 22:06:26,222 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 10 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2025-03-08 22:06:26,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 653 transitions, 1338 flow [2025-03-08 22:06:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2017 transitions. [2025-03-08 22:06:26,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536643026004729 [2025-03-08 22:06:26,227 INFO L175 Difference]: Start difference. First operand has 649 places, 654 transitions, 1316 flow. Second operand 3 states and 2017 transitions. [2025-03-08 22:06:26,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 653 transitions, 1338 flow [2025-03-08 22:06:26,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 653 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:26,235 INFO L231 Difference]: Finished difference. Result has 648 places, 653 transitions, 1314 flow [2025-03-08 22:06:26,236 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-08 22:06:26,237 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2025-03-08 22:06:26,237 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 653 transitions, 1314 flow [2025-03-08 22:06:26,238 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-08 22:06:26,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:26,239 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-08 22:06:26,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:06:26,239 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-08 22:06:26,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -518922382, now seen corresponding path program 1 times [2025-03-08 22:06:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998566371] [2025-03-08 22:06:26,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:26,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 22:06:26,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 22:06:26,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:26,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:26,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:26,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998566371] [2025-03-08 22:06:26,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998566371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:26,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:26,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364510943] [2025-03-08 22:06:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:26,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:26,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:26,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:26,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-08 22:06:26,292 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-08 22:06:26,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:26,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-08 22:06:26,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:26,429 INFO L124 PetriNetUnfolderBase]: 29/1717 cut-off events. [2025-03-08 22:06:26,429 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 22:06:26,437 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-08 22:06:26,442 INFO L140 encePairwiseOnDemand]: 701/705 looper letters, 10 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2025-03-08 22:06:26,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 650 transitions, 1330 flow [2025-03-08 22:06:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-03-08 22:06:26,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541371158392435 [2025-03-08 22:06:26,445 INFO L175 Difference]: Start difference. First operand has 648 places, 653 transitions, 1314 flow. Second operand 3 states and 2018 transitions. [2025-03-08 22:06:26,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 650 transitions, 1330 flow [2025-03-08 22:06:26,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 650 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:26,451 INFO L231 Difference]: Finished difference. Result has 645 places, 650 transitions, 1306 flow [2025-03-08 22:06:26,452 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-08 22:06:26,452 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -17 predicate places. [2025-03-08 22:06:26,452 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 650 transitions, 1306 flow [2025-03-08 22:06:26,453 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-08 22:06:26,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:26,453 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-08 22:06:26,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:06:26,453 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-08 22:06:26,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash -588922876, now seen corresponding path program 1 times [2025-03-08 22:06:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252044339] [2025-03-08 22:06:26,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:26,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 22:06:26,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 22:06:26,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:26,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:26,984 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-08 22:06:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252044339] [2025-03-08 22:06:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252044339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:26,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181108813] [2025-03-08 22:06:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:26,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:26,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:26,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:27,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 705 [2025-03-08 22:06:27,169 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-08 22:06:27,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:27,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 705 [2025-03-08 22:06:27,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:27,669 INFO L124 PetriNetUnfolderBase]: 244/4163 cut-off events. [2025-03-08 22:06:27,669 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-03-08 22:06:27,679 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-08 22:06:27,688 INFO L140 encePairwiseOnDemand]: 699/705 looper letters, 36 selfloop transitions, 5 changer transitions 0/649 dead transitions. [2025-03-08 22:06:27,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 649 transitions, 1386 flow [2025-03-08 22:06:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3882 transitions. [2025-03-08 22:06:27,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177304964539007 [2025-03-08 22:06:27,694 INFO L175 Difference]: Start difference. First operand has 645 places, 650 transitions, 1306 flow. Second operand 6 states and 3882 transitions. [2025-03-08 22:06:27,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 649 transitions, 1386 flow [2025-03-08 22:06:27,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 649 transitions, 1385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:27,700 INFO L231 Difference]: Finished difference. Result has 648 places, 649 transitions, 1313 flow [2025-03-08 22:06:27,700 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-08 22:06:27,701 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2025-03-08 22:06:27,701 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 649 transitions, 1313 flow [2025-03-08 22:06:27,703 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-08 22:06:27,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:27,703 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-08 22:06:27,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:06:27,703 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-08 22:06:27,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash -134011025, now seen corresponding path program 1 times [2025-03-08 22:06:27,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:27,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010607037] [2025-03-08 22:06:27,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:27,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:27,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 22:06:27,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 22:06:27,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:27,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010607037] [2025-03-08 22:06:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010607037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:27,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:27,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613207908] [2025-03-08 22:06:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:27,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:27,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:27,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:27,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:27,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-08 22:06:27,775 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-08 22:06:27,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:27,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-08 22:06:27,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:27,900 INFO L124 PetriNetUnfolderBase]: 34/1521 cut-off events. [2025-03-08 22:06:27,901 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-08 22:06:27,907 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-08 22:06:27,912 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2025-03-08 22:06:27,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 648 transitions, 1341 flow [2025-03-08 22:06:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-08 22:06:27,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-08 22:06:27,915 INFO L175 Difference]: Start difference. First operand has 648 places, 649 transitions, 1313 flow. Second operand 3 states and 2011 transitions. [2025-03-08 22:06:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 648 transitions, 1341 flow [2025-03-08 22:06:27,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 648 transitions, 1331 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:06:27,921 INFO L231 Difference]: Finished difference. Result has 644 places, 648 transitions, 1305 flow [2025-03-08 22:06:27,922 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-08 22:06:27,923 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -18 predicate places. [2025-03-08 22:06:27,923 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 648 transitions, 1305 flow [2025-03-08 22:06:27,924 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-08 22:06:27,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:27,924 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-08 22:06:27,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:06:27,924 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-08 22:06:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1820509187, now seen corresponding path program 1 times [2025-03-08 22:06:27,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890089773] [2025-03-08 22:06:27,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:27,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 22:06:27,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 22:06:27,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:27,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:27,955 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-08 22:06:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890089773] [2025-03-08 22:06:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890089773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219885563] [2025-03-08 22:06:27,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:27,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:27,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:27,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 705 [2025-03-08 22:06:27,992 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-08 22:06:27,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:27,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 705 [2025-03-08 22:06:27,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:28,102 INFO L124 PetriNetUnfolderBase]: 28/1297 cut-off events. [2025-03-08 22:06:28,103 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:06:28,110 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-08 22:06:28,113 INFO L140 encePairwiseOnDemand]: 690/705 looper letters, 25 selfloop transitions, 5 changer transitions 0/641 dead transitions. [2025-03-08 22:06:28,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 641 transitions, 1352 flow [2025-03-08 22:06:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2025-03-08 22:06:28,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.933806146572104 [2025-03-08 22:06:28,117 INFO L175 Difference]: Start difference. First operand has 644 places, 648 transitions, 1305 flow. Second operand 3 states and 1975 transitions. [2025-03-08 22:06:28,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 641 transitions, 1352 flow [2025-03-08 22:06:28,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 641 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:28,143 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1304 flow [2025-03-08 22:06:28,144 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-08 22:06:28,144 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -27 predicate places. [2025-03-08 22:06:28,144 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1304 flow [2025-03-08 22:06:28,145 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-08 22:06:28,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:28,145 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-08 22:06:28,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:06:28,146 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-08 22:06:28,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1457664460, now seen corresponding path program 1 times [2025-03-08 22:06:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318183968] [2025-03-08 22:06:28,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:28,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 22:06:28,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 22:06:28,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:28,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:28,177 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-08 22:06:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318183968] [2025-03-08 22:06:28,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318183968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:28,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386913453] [2025-03-08 22:06:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:28,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:28,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:28,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:28,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 705 [2025-03-08 22:06:28,205 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-08 22:06:28,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:28,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 705 [2025-03-08 22:06:28,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:28,295 INFO L124 PetriNetUnfolderBase]: 25/876 cut-off events. [2025-03-08 22:06:28,295 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-03-08 22:06:28,302 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-08 22:06:28,305 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 15 selfloop transitions, 5 changer transitions 0/638 dead transitions. [2025-03-08 22:06:28,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 638 transitions, 1341 flow [2025-03-08 22:06:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2005 transitions. [2025-03-08 22:06:28,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479905437352246 [2025-03-08 22:06:28,309 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1304 flow. Second operand 3 states and 2005 transitions. [2025-03-08 22:06:28,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 638 transitions, 1341 flow [2025-03-08 22:06:28,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 638 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:28,317 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1312 flow [2025-03-08 22:06:28,318 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-08 22:06:28,319 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -30 predicate places. [2025-03-08 22:06:28,320 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1312 flow [2025-03-08 22:06:28,321 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-08 22:06:28,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:28,321 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-08 22:06:28,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:06:28,321 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-08 22:06:28,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1191689848, now seen corresponding path program 1 times [2025-03-08 22:06:28,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:28,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674539617] [2025-03-08 22:06:28,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:28,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 22:06:28,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 22:06:28,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:28,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:28,364 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-08 22:06:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674539617] [2025-03-08 22:06:28,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674539617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:28,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:28,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534292707] [2025-03-08 22:06:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:28,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:28,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:28,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:28,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-03-08 22:06:28,389 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-08 22:06:28,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:28,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-03-08 22:06:28,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:28,554 INFO L124 PetriNetUnfolderBase]: 40/1573 cut-off events. [2025-03-08 22:06:28,554 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-08 22:06:28,566 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-08 22:06:28,571 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 13 selfloop transitions, 6 changer transitions 0/637 dead transitions. [2025-03-08 22:06:28,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 637 transitions, 1352 flow [2025-03-08 22:06:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-03-08 22:06:28,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-03-08 22:06:28,574 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1312 flow. Second operand 3 states and 2012 transitions. [2025-03-08 22:06:28,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 637 transitions, 1352 flow [2025-03-08 22:06:28,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 637 transitions, 1347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:28,583 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1325 flow [2025-03-08 22:06:28,584 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-08 22:06:28,584 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -32 predicate places. [2025-03-08 22:06:28,584 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1325 flow [2025-03-08 22:06:28,589 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-08 22:06:28,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:28,589 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-08 22:06:28,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:06:28,589 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-08 22:06:28,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash -496785864, now seen corresponding path program 1 times [2025-03-08 22:06:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:28,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891672477] [2025-03-08 22:06:28,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:28,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:28,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 22:06:28,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 22:06:28,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:28,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:28,624 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-08 22:06:28,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:28,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891672477] [2025-03-08 22:06:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891672477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:28,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786443230] [2025-03-08 22:06:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:28,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:28,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:28,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:28,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-03-08 22:06:28,648 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-08 22:06:28,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:28,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-03-08 22:06:28,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:28,849 INFO L124 PetriNetUnfolderBase]: 53/1813 cut-off events. [2025-03-08 22:06:28,849 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-08 22:06:28,868 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-08 22:06:28,874 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 12 selfloop transitions, 5 changer transitions 4/636 dead transitions. [2025-03-08 22:06:28,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 636 transitions, 1368 flow [2025-03-08 22:06:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-03-08 22:06:28,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-03-08 22:06:28,878 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1325 flow. Second operand 3 states and 2012 transitions. [2025-03-08 22:06:28,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 636 transitions, 1368 flow [2025-03-08 22:06:28,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 636 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:28,886 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1323 flow [2025-03-08 22:06:28,887 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-08 22:06:28,887 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -34 predicate places. [2025-03-08 22:06:28,887 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1323 flow [2025-03-08 22:06:28,888 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-08 22:06:28,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:28,888 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-08 22:06:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:06:28,888 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-08 22:06:28,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash -203516272, now seen corresponding path program 1 times [2025-03-08 22:06:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:28,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376361031] [2025-03-08 22:06:28,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:28,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 22:06:28,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 22:06:28,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:28,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:28,930 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-08 22:06:28,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:28,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376361031] [2025-03-08 22:06:28,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376361031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:28,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:28,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430814888] [2025-03-08 22:06:28,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:28,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:28,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:28,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:28,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:28,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-03-08 22:06:28,956 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-08 22:06:28,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:28,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-03-08 22:06:28,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:29,347 INFO L124 PetriNetUnfolderBase]: 129/3255 cut-off events. [2025-03-08 22:06:29,348 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:06:29,365 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-08 22:06:29,372 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 17 selfloop transitions, 3 changer transitions 0/626 dead transitions. [2025-03-08 22:06:29,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1359 flow [2025-03-08 22:06:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2000 transitions. [2025-03-08 22:06:29,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2025-03-08 22:06:29,375 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1323 flow. Second operand 3 states and 2000 transitions. [2025-03-08 22:06:29,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1359 flow [2025-03-08 22:06:29,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 626 transitions, 1354 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:29,385 INFO L231 Difference]: Finished difference. Result has 620 places, 624 transitions, 1319 flow [2025-03-08 22:06:29,385 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-08 22:06:29,385 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -42 predicate places. [2025-03-08 22:06:29,386 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 624 transitions, 1319 flow [2025-03-08 22:06:29,386 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-08 22:06:29,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:06:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:06:29,386 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-08 22:06:29,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2064126562, now seen corresponding path program 1 times [2025-03-08 22:06:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544099343] [2025-03-08 22:06:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:29,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 22:06:29,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 22:06:29,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:29,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544099343] [2025-03-08 22:06:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544099343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510953299] [2025-03-08 22:06:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:29,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:29,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:29,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-03-08 22:06:29,453 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-08 22:06:29,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:29,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-03-08 22:06:29,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:29,884 INFO L124 PetriNetUnfolderBase]: 122/3768 cut-off events. [2025-03-08 22:06:29,884 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2025-03-08 22:06:29,910 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-08 22:06:29,919 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 18 selfloop transitions, 3 changer transitions 0/622 dead transitions. [2025-03-08 22:06:29,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 622 transitions, 1360 flow [2025-03-08 22:06:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2001 transitions. [2025-03-08 22:06:29,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460992907801419 [2025-03-08 22:06:29,922 INFO L175 Difference]: Start difference. First operand has 620 places, 624 transitions, 1319 flow. Second operand 3 states and 2001 transitions. [2025-03-08 22:06:29,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 622 transitions, 1360 flow [2025-03-08 22:06:29,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 622 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:29,932 INFO L231 Difference]: Finished difference. Result has 616 places, 619 transitions, 1317 flow [2025-03-08 22:06:29,932 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-08 22:06:29,933 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -46 predicate places. [2025-03-08 22:06:29,933 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 619 transitions, 1317 flow [2025-03-08 22:06:29,933 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-08 22:06:29,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:29,933 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-08 22:06:29,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:06:29,934 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-08 22:06:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1538335944, now seen corresponding path program 1 times [2025-03-08 22:06:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:29,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344021108] [2025-03-08 22:06:29,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:29,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 22:06:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 22:06:29,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:29,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:29,983 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-08 22:06:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344021108] [2025-03-08 22:06:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344021108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861386273] [2025-03-08 22:06:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:29,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:29,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:29,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:30,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-03-08 22:06:30,009 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-08 22:06:30,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:30,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-03-08 22:06:30,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:31,009 INFO L124 PetriNetUnfolderBase]: 354/9609 cut-off events. [2025-03-08 22:06:31,010 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2025-03-08 22:06:31,071 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-08 22:06:31,091 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 18 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2025-03-08 22:06:31,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 617 transitions, 1355 flow [2025-03-08 22:06:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2003 transitions. [2025-03-08 22:06:31,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9470449172576832 [2025-03-08 22:06:31,094 INFO L175 Difference]: Start difference. First operand has 616 places, 619 transitions, 1317 flow. Second operand 3 states and 2003 transitions. [2025-03-08 22:06:31,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 617 transitions, 1355 flow [2025-03-08 22:06:31,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 617 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:31,101 INFO L231 Difference]: Finished difference. Result has 612 places, 615 transitions, 1316 flow [2025-03-08 22:06:31,102 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-08 22:06:31,102 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -50 predicate places. [2025-03-08 22:06:31,102 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 615 transitions, 1316 flow [2025-03-08 22:06:31,103 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-08 22:06:31,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:31,103 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-08 22:06:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:06:31,103 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-08 22:06:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2015722289, now seen corresponding path program 1 times [2025-03-08 22:06:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330861498] [2025-03-08 22:06:31,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:31,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 22:06:31,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 22:06:31,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:31,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:31,474 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-08 22:06:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330861498] [2025-03-08 22:06:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330861498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135790266] [2025-03-08 22:06:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:31,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:31,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:31,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:31,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-03-08 22:06:31,752 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-08 22:06:31,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:31,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-03-08 22:06:31,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:32,420 INFO L124 PetriNetUnfolderBase]: 233/5969 cut-off events. [2025-03-08 22:06:32,421 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-03-08 22:06:32,447 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-08 22:06:32,456 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/616 dead transitions. [2025-03-08 22:06:32,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 616 transitions, 1384 flow [2025-03-08 22:06:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-03-08 22:06:32,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-03-08 22:06:32,460 INFO L175 Difference]: Start difference. First operand has 612 places, 615 transitions, 1316 flow. Second operand 6 states and 3940 transitions. [2025-03-08 22:06:32,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 616 transitions, 1384 flow [2025-03-08 22:06:32,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 616 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:32,467 INFO L231 Difference]: Finished difference. Result has 614 places, 612 transitions, 1320 flow [2025-03-08 22:06:32,467 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-08 22:06:32,468 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -48 predicate places. [2025-03-08 22:06:32,468 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 612 transitions, 1320 flow [2025-03-08 22:06:32,469 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-08 22:06:32,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:32,469 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-08 22:06:32,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:06:32,469 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-08 22:06:32,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -683827749, now seen corresponding path program 1 times [2025-03-08 22:06:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095541632] [2025-03-08 22:06:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:32,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 22:06:32,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 22:06:32,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:32,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:32,813 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-08 22:06:32,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095541632] [2025-03-08 22:06:32,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095541632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:32,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:32,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510502829] [2025-03-08 22:06:32,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:32,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:32,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:32,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:33,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-03-08 22:06:33,053 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-08 22:06:33,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:33,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-03-08 22:06:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:33,552 INFO L124 PetriNetUnfolderBase]: 160/4614 cut-off events. [2025-03-08 22:06:33,552 INFO L125 PetriNetUnfolderBase]: For 62/70 co-relation queries the response was YES. [2025-03-08 22:06:33,586 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-08 22:06:33,595 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/613 dead transitions. [2025-03-08 22:06:33,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 613 transitions, 1388 flow [2025-03-08 22:06:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-03-08 22:06:33,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-03-08 22:06:33,600 INFO L175 Difference]: Start difference. First operand has 614 places, 612 transitions, 1320 flow. Second operand 6 states and 3940 transitions. [2025-03-08 22:06:33,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 613 transitions, 1388 flow [2025-03-08 22:06:33,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 613 transitions, 1378 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:06:33,646 INFO L231 Difference]: Finished difference. Result has 611 places, 609 transitions, 1314 flow [2025-03-08 22:06:33,647 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-08 22:06:33,647 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -51 predicate places. [2025-03-08 22:06:33,648 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 609 transitions, 1314 flow [2025-03-08 22:06:33,648 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-08 22:06:33,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:33,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:06:33,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:06:33,649 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-08 22:06:33,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash -298536821, now seen corresponding path program 1 times [2025-03-08 22:06:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:33,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387650410] [2025-03-08 22:06:33,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:33,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 22:06:33,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 22:06:33,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:33,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:33,701 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-08 22:06:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387650410] [2025-03-08 22:06:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387650410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:33,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:33,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087842392] [2025-03-08 22:06:33,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:33,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:33,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:33,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:33,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-08 22:06:33,729 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-08 22:06:33,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:33,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-08 22:06:33,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:34,577 INFO L124 PetriNetUnfolderBase]: 208/6152 cut-off events. [2025-03-08 22:06:34,578 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-08 22:06:34,620 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-08 22:06:34,631 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2025-03-08 22:06:34,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 609 transitions, 1345 flow [2025-03-08 22:06:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-08 22:06:34,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-08 22:06:34,634 INFO L175 Difference]: Start difference. First operand has 611 places, 609 transitions, 1314 flow. Second operand 3 states and 2015 transitions. [2025-03-08 22:06:34,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 609 transitions, 1345 flow [2025-03-08 22:06:34,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 609 transitions, 1335 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:06:34,641 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1306 flow [2025-03-08 22:06:34,642 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-08 22:06:34,642 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-08 22:06:34,642 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1306 flow [2025-03-08 22:06:34,643 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-08 22:06:34,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:34,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:06:34,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:06:34,643 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-08 22:06:34,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1778470185, now seen corresponding path program 1 times [2025-03-08 22:06:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512689335] [2025-03-08 22:06:34,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:34,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 22:06:34,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 22:06:34,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:34,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:34,680 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-08 22:06:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512689335] [2025-03-08 22:06:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512689335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:34,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:34,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:34,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415247871] [2025-03-08 22:06:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:34,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:34,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:34,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:34,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-03-08 22:06:34,688 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-08 22:06:34,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:34,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-03-08 22:06:34,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:35,317 INFO L124 PetriNetUnfolderBase]: 145/6333 cut-off events. [2025-03-08 22:06:35,318 INFO L125 PetriNetUnfolderBase]: For 20/24 co-relation queries the response was YES. [2025-03-08 22:06:35,361 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-08 22:06:35,371 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 8 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2025-03-08 22:06:35,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 610 transitions, 1330 flow [2025-03-08 22:06:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2032 transitions. [2025-03-08 22:06:35,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607565011820332 [2025-03-08 22:06:35,373 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1306 flow. Second operand 3 states and 2032 transitions. [2025-03-08 22:06:35,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 610 transitions, 1330 flow [2025-03-08 22:06:35,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 610 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:35,379 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1307 flow [2025-03-08 22:06:35,380 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-08 22:06:35,380 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-08 22:06:35,380 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1307 flow [2025-03-08 22:06:35,380 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-08 22:06:35,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:35,381 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-08 22:06:35,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:06:35,381 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-08 22:06:35,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1136686709, now seen corresponding path program 1 times [2025-03-08 22:06:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766900712] [2025-03-08 22:06:35,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:35,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 22:06:35,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 22:06:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:06:35,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:35,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766900712] [2025-03-08 22:06:35,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766900712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:35,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:35,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461058801] [2025-03-08 22:06:35,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:35,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:35,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:35,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:35,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-08 22:06:35,433 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-08 22:06:35,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:35,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-08 22:06:35,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:35,954 INFO L124 PetriNetUnfolderBase]: 143/5379 cut-off events. [2025-03-08 22:06:35,954 INFO L125 PetriNetUnfolderBase]: For 99/107 co-relation queries the response was YES. [2025-03-08 22:06:35,993 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-08 22:06:36,001 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 12 selfloop transitions, 2 changer transitions 1/608 dead transitions. [2025-03-08 22:06:36,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 608 transitions, 1338 flow [2025-03-08 22:06:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-08 22:06:36,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-08 22:06:36,004 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1307 flow. Second operand 3 states and 2015 transitions. [2025-03-08 22:06:36,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 608 transitions, 1338 flow [2025-03-08 22:06:36,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 608 transitions, 1338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:36,010 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1309 flow [2025-03-08 22:06:36,011 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-08 22:06:36,011 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-08 22:06:36,011 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1309 flow [2025-03-08 22:06:36,012 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-08 22:06:36,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:36,012 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-08 22:06:36,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:06:36,012 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-08 22:06:36,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 952893139, now seen corresponding path program 1 times [2025-03-08 22:06:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780117162] [2025-03-08 22:06:36,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:36,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 22:06:36,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 22:06:36,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:36,044 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-08 22:06:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780117162] [2025-03-08 22:06:36,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780117162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900232599] [2025-03-08 22:06:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:36,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:36,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:36,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:36,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:36,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-03-08 22:06:36,052 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-08 22:06:36,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:36,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-03-08 22:06:36,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:36,680 INFO L124 PetriNetUnfolderBase]: 135/6249 cut-off events. [2025-03-08 22:06:36,680 INFO L125 PetriNetUnfolderBase]: For 30/38 co-relation queries the response was YES. [2025-03-08 22:06:36,717 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-08 22:06:36,723 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 7 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2025-03-08 22:06:36,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 608 transitions, 1328 flow [2025-03-08 22:06:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2025-03-08 22:06:36,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602836879432625 [2025-03-08 22:06:36,726 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1309 flow. Second operand 3 states and 2031 transitions. [2025-03-08 22:06:36,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 608 transitions, 1328 flow [2025-03-08 22:06:36,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 608 transitions, 1324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:36,731 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1310 flow [2025-03-08 22:06:36,732 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-08 22:06:36,732 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-08 22:06:36,732 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1310 flow [2025-03-08 22:06:36,733 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-08 22:06:36,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:36,733 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-08 22:06:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:06:36,733 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-08 22:06:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash -57535030, now seen corresponding path program 1 times [2025-03-08 22:06:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896949552] [2025-03-08 22:06:36,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:36,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 22:06:36,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 22:06:36,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:36,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:36,768 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-08 22:06:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896949552] [2025-03-08 22:06:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896949552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:36,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047678715] [2025-03-08 22:06:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:36,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:36,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:36,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:36,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-08 22:06:36,791 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-08 22:06:36,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:36,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-08 22:06:36,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:37,944 INFO L124 PetriNetUnfolderBase]: 231/8833 cut-off events. [2025-03-08 22:06:37,944 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-08 22:06:37,995 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-08 22:06:38,006 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2025-03-08 22:06:38,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 607 transitions, 1341 flow [2025-03-08 22:06:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-08 22:06:38,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-08 22:06:38,009 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1310 flow. Second operand 3 states and 2015 transitions. [2025-03-08 22:06:38,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 607 transitions, 1341 flow [2025-03-08 22:06:38,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 607 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:38,015 INFO L231 Difference]: Finished difference. Result has 609 places, 606 transitions, 1312 flow [2025-03-08 22:06:38,015 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-08 22:06:38,015 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -53 predicate places. [2025-03-08 22:06:38,016 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 606 transitions, 1312 flow [2025-03-08 22:06:38,016 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-08 22:06:38,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:38,016 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-08 22:06:38,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:06:38,016 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-08 22:06:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash -841480642, now seen corresponding path program 1 times [2025-03-08 22:06:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462643706] [2025-03-08 22:06:38,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:38,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-08 22:06:38,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-08 22:06:38,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:38,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:38,049 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-08 22:06:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462643706] [2025-03-08 22:06:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462643706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054059051] [2025-03-08 22:06:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:38,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:38,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:38,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:38,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-08 22:06:38,073 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-08 22:06:38,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:38,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-08 22:06:38,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:38,732 INFO L124 PetriNetUnfolderBase]: 147/6049 cut-off events. [2025-03-08 22:06:38,732 INFO L125 PetriNetUnfolderBase]: For 105/113 co-relation queries the response was YES. [2025-03-08 22:06:38,771 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-08 22:06:38,777 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2025-03-08 22:06:38,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 606 transitions, 1343 flow [2025-03-08 22:06:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-08 22:06:38,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-08 22:06:38,779 INFO L175 Difference]: Start difference. First operand has 609 places, 606 transitions, 1312 flow. Second operand 3 states and 2015 transitions. [2025-03-08 22:06:38,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 606 transitions, 1343 flow [2025-03-08 22:06:38,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 606 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:38,785 INFO L231 Difference]: Finished difference. Result has 608 places, 605 transitions, 1310 flow [2025-03-08 22:06:38,785 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-08 22:06:38,786 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-08 22:06:38,786 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 605 transitions, 1310 flow [2025-03-08 22:06:38,786 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-08 22:06:38,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:38,786 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-08 22:06:38,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:06:38,787 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-08 22:06:38,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash -547967891, now seen corresponding path program 1 times [2025-03-08 22:06:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:38,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247456189] [2025-03-08 22:06:38,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:38,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 22:06:38,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 22:06:38,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:38,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:38,823 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-08 22:06:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:38,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247456189] [2025-03-08 22:06:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247456189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:38,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:38,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727798125] [2025-03-08 22:06:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:38,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:38,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:38,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:38,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-03-08 22:06:38,864 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-08 22:06:38,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:38,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-03-08 22:06:38,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:39,901 INFO L124 PetriNetUnfolderBase]: 281/10327 cut-off events. [2025-03-08 22:06:39,902 INFO L125 PetriNetUnfolderBase]: For 90/94 co-relation queries the response was YES. [2025-03-08 22:06:39,950 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-08 22:06:39,962 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2025-03-08 22:06:39,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 605 transitions, 1355 flow [2025-03-08 22:06:39,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-03-08 22:06:39,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-03-08 22:06:39,967 INFO L175 Difference]: Start difference. First operand has 608 places, 605 transitions, 1310 flow. Second operand 3 states and 2004 transitions. [2025-03-08 22:06:39,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 605 transitions, 1355 flow [2025-03-08 22:06:39,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 605 transitions, 1351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:39,973 INFO L231 Difference]: Finished difference. Result has 607 places, 604 transitions, 1308 flow [2025-03-08 22:06:39,973 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-08 22:06:39,973 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-08 22:06:39,974 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 604 transitions, 1308 flow [2025-03-08 22:06:39,974 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-08 22:06:39,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:39,974 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-08 22:06:39,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:06:39,974 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-08 22:06:39,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1863301089, now seen corresponding path program 1 times [2025-03-08 22:06:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:39,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680828875] [2025-03-08 22:06:39,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:39,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 22:06:39,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 22:06:39,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:39,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:40,020 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-08 22:06:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680828875] [2025-03-08 22:06:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680828875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638720097] [2025-03-08 22:06:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:40,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:40,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:40,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:40,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-08 22:06:40,049 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-08 22:06:40,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:40,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-08 22:06:40,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:40,731 INFO L124 PetriNetUnfolderBase]: 163/6447 cut-off events. [2025-03-08 22:06:40,731 INFO L125 PetriNetUnfolderBase]: For 111/119 co-relation queries the response was YES. [2025-03-08 22:06:40,768 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-08 22:06:40,775 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2025-03-08 22:06:40,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 604 transitions, 1343 flow [2025-03-08 22:06:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-08 22:06:40,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-08 22:06:40,777 INFO L175 Difference]: Start difference. First operand has 607 places, 604 transitions, 1308 flow. Second operand 3 states and 2014 transitions. [2025-03-08 22:06:40,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 604 transitions, 1343 flow [2025-03-08 22:06:40,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 604 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:40,782 INFO L231 Difference]: Finished difference. Result has 606 places, 603 transitions, 1306 flow [2025-03-08 22:06:40,783 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-08 22:06:40,783 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-03-08 22:06:40,784 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 603 transitions, 1306 flow [2025-03-08 22:06:40,784 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-08 22:06:40,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:40,784 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-08 22:06:40,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:06:40,784 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-08 22:06:40,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1250973893, now seen corresponding path program 1 times [2025-03-08 22:06:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:40,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946460622] [2025-03-08 22:06:40,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:40,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-08 22:06:40,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-08 22:06:40,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:40,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:40,823 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-08 22:06:40,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:40,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946460622] [2025-03-08 22:06:40,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946460622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:40,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:40,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904600914] [2025-03-08 22:06:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:40,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:40,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:40,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:40,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-03-08 22:06:40,867 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-08 22:06:40,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:40,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-03-08 22:06:40,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:42,197 INFO L124 PetriNetUnfolderBase]: 283/10615 cut-off events. [2025-03-08 22:06:42,197 INFO L125 PetriNetUnfolderBase]: For 121/129 co-relation queries the response was YES. [2025-03-08 22:06:42,261 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-08 22:06:42,275 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2025-03-08 22:06:42,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 603 transitions, 1351 flow [2025-03-08 22:06:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-03-08 22:06:42,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-03-08 22:06:42,277 INFO L175 Difference]: Start difference. First operand has 606 places, 603 transitions, 1306 flow. Second operand 3 states and 2004 transitions. [2025-03-08 22:06:42,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 603 transitions, 1351 flow [2025-03-08 22:06:42,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 603 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:42,283 INFO L231 Difference]: Finished difference. Result has 605 places, 602 transitions, 1304 flow [2025-03-08 22:06:42,284 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-08 22:06:42,284 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -57 predicate places. [2025-03-08 22:06:42,284 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 602 transitions, 1304 flow [2025-03-08 22:06:42,285 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-08 22:06:42,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:42,285 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-08 22:06:42,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:06:42,285 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-08 22:06:42,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash -379482824, now seen corresponding path program 1 times [2025-03-08 22:06:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:42,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265869606] [2025-03-08 22:06:42,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:42,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-08 22:06:42,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-08 22:06:42,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:42,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:42,335 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-08 22:06:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265869606] [2025-03-08 22:06:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265869606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:42,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121133750] [2025-03-08 22:06:42,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:42,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:42,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:42,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:42,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-08 22:06:42,373 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-08 22:06:42,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:42,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-08 22:06:42,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:43,203 INFO L124 PetriNetUnfolderBase]: 233/7345 cut-off events. [2025-03-08 22:06:43,203 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-08 22:06:43,237 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-08 22:06:43,244 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-03-08 22:06:43,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 602 transitions, 1337 flow [2025-03-08 22:06:43,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-08 22:06:43,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-08 22:06:43,245 INFO L175 Difference]: Start difference. First operand has 605 places, 602 transitions, 1304 flow. Second operand 3 states and 2014 transitions. [2025-03-08 22:06:43,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 602 transitions, 1337 flow [2025-03-08 22:06:43,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 602 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:43,250 INFO L231 Difference]: Finished difference. Result has 604 places, 601 transitions, 1302 flow [2025-03-08 22:06:43,251 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-08 22:06:43,251 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -58 predicate places. [2025-03-08 22:06:43,251 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 601 transitions, 1302 flow [2025-03-08 22:06:43,252 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-08 22:06:43,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:43,252 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-08 22:06:43,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:06:43,252 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-08 22:06:43,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:43,253 INFO L85 PathProgramCache]: Analyzing trace with hash 407948719, now seen corresponding path program 1 times [2025-03-08 22:06:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457354411] [2025-03-08 22:06:43,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:43,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 22:06:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 22:06:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:43,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:43,292 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-08 22:06:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457354411] [2025-03-08 22:06:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457354411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:43,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285576789] [2025-03-08 22:06:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:43,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:43,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:43,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:43,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-08 22:06:43,320 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-08 22:06:43,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:43,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-08 22:06:43,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:44,028 INFO L124 PetriNetUnfolderBase]: 155/6417 cut-off events. [2025-03-08 22:06:44,028 INFO L125 PetriNetUnfolderBase]: For 113/121 co-relation queries the response was YES. [2025-03-08 22:06:44,082 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-08 22:06:44,090 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-03-08 22:06:44,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 601 transitions, 1337 flow [2025-03-08 22:06:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-08 22:06:44,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-08 22:06:44,092 INFO L175 Difference]: Start difference. First operand has 604 places, 601 transitions, 1302 flow. Second operand 3 states and 2014 transitions. [2025-03-08 22:06:44,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 601 transitions, 1337 flow [2025-03-08 22:06:44,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:44,097 INFO L231 Difference]: Finished difference. Result has 603 places, 600 transitions, 1300 flow [2025-03-08 22:06:44,098 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-08 22:06:44,098 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -59 predicate places. [2025-03-08 22:06:44,098 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 600 transitions, 1300 flow [2025-03-08 22:06:44,099 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-08 22:06:44,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:44,099 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-08 22:06:44,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:06:44,099 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-08 22:06:44,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash 412287596, now seen corresponding path program 1 times [2025-03-08 22:06:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:44,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693867908] [2025-03-08 22:06:44,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:44,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:44,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 22:06:44,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 22:06:44,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:44,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:44,143 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-08 22:06:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:44,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693867908] [2025-03-08 22:06:44,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693867908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:44,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350702602] [2025-03-08 22:06:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:44,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:44,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:44,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:44,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:44,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-08 22:06:44,169 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-08 22:06:44,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:44,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-08 22:06:44,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:44,782 INFO L124 PetriNetUnfolderBase]: 175/6445 cut-off events. [2025-03-08 22:06:44,782 INFO L125 PetriNetUnfolderBase]: For 92/100 co-relation queries the response was YES. [2025-03-08 22:06:44,825 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-08 22:06:44,827 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 0 selfloop transitions, 0 changer transitions 600/600 dead transitions. [2025-03-08 22:06:44,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 600 transitions, 1333 flow [2025-03-08 22:06:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-08 22:06:44,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-08 22:06:44,828 INFO L175 Difference]: Start difference. First operand has 603 places, 600 transitions, 1300 flow. Second operand 3 states and 2014 transitions. [2025-03-08 22:06:44,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 600 transitions, 1333 flow [2025-03-08 22:06:44,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 600 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:44,832 INFO L231 Difference]: Finished difference. Result has 602 places, 0 transitions, 0 flow [2025-03-08 22:06:44,833 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-08 22:06:44,833 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -60 predicate places. [2025-03-08 22:06:44,833 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 0 transitions, 0 flow [2025-03-08 22:06:44,833 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-08 22:06:44,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (122 of 123 remaining) [2025-03-08 22:06:44,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (121 of 123 remaining) [2025-03-08 22:06:44,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (120 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (119 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (118 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (117 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (116 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (115 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (114 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (113 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (112 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (108 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (107 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (106 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (105 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (104 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (103 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (102 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (101 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (100 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (98 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (97 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (96 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (95 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (94 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (93 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (92 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (91 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (89 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (88 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (87 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (86 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (85 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (84 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (83 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (82 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (81 of 123 remaining) [2025-03-08 22:06:44,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (80 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (79 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (77 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (76 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (75 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (74 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (73 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (72 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (71 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (70 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (69 of 123 remaining) [2025-03-08 22:06:44,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (68 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (67 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (66 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (63 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (61 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (60 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (59 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (57 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (56 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (55 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (53 of 123 remaining) [2025-03-08 22:06:44,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (47 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (45 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (43 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (42 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (41 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (40 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (39 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (38 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (36 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (32 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (31 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (30 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 123 remaining) [2025-03-08 22:06:44,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (28 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (27 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (21 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (19 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (17 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (16 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (12 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (10 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (6 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (4 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 123 remaining) [2025-03-08 22:06:44,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 123 remaining) [2025-03-08 22:06:44,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:06:44,841 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-08 22:06:44,845 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:06:44,845 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:06:44,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:06:44 BasicIcfg [2025-03-08 22:06:44,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:06:44,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:06:44,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:06:44,851 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:06:44,851 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:06:23" (3/4) ... [2025-03-08 22:06:44,852 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:06:44,854 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:06:44,855 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:06:44,862 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-08 22:06:44,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:06:44,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:06:44,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:06:44,929 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:06:44,930 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:06:44,930 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:06:44,930 INFO L158 Benchmark]: Toolchain (without parser) took 22775.96ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 112.6MB in the beginning and 982.1MB in the end (delta: -869.5MB). Peak memory consumption was 337.6MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,931 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:06:44,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.65ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 99.3MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 95.6MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,932 INFO L158 Benchmark]: Boogie Preprocessor took 40.61ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:06:44,933 INFO L158 Benchmark]: IcfgBuilder took 891.38ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 50.2MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,933 INFO L158 Benchmark]: TraceAbstraction took 21485.31ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 49.3MB in the beginning and 990.5MB in the end (delta: -941.2MB). Peak memory consumption was 757.1MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,933 INFO L158 Benchmark]: Witness Printer took 79.31ms. Allocated memory is still 1.4GB. Free memory was 990.5MB in the beginning and 982.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,934 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 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.65ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 99.3MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 95.6MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.61ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 891.38ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 50.2MB in the end (delta: 43.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21485.31ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 49.3MB in the beginning and 990.5MB in the end (delta: -941.2MB). Peak memory consumption was 757.1MB. Max. memory is 16.1GB. * Witness Printer took 79.31ms. Allocated memory is still 1.4GB. Free memory was 990.5MB in the beginning and 982.1MB in the end (delta: 8.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, 1153 edges, 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: 21.3s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, 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-08 22:06:44,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE